Symmetries and Integrability of Difference Equations 2017
DOI: 10.1007/978-3-319-56666-5_3
|View full text |Cite
|
Sign up to set email alerts
|

Integrability of Difference Equations Through Algebraic Entropy and Generalized Symmetries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(25 citation statements)
references
References 97 publications
0
21
0
Order By: Relevance
“…A generating function is a predictive tool which can be used to test the successive members of a finite sequence. It follows that the algebraic entropy is given by the logarithm of the smallest pole of the generating function, see [25,27]. A birational map (or its avatar difference equation) will then be integrable if all the poles of the generating function lie on the unit circle.…”
Section: Appendix B Algebraic Entropymentioning
confidence: 99%
“…A generating function is a predictive tool which can be used to test the successive members of a finite sequence. It follows that the algebraic entropy is given by the logarithm of the smallest pole of the generating function, see [25,27]. A birational map (or its avatar difference equation) will then be integrable if all the poles of the generating function lie on the unit circle.…”
Section: Appendix B Algebraic Entropymentioning
confidence: 99%
“…A generating function is a predictive tool which can be used to test the successive members of a finite sequence. It follows that the algebraic entropy is given by the logarithm of the smallest pole of the generating function, see [18,19].…”
Section: 2mentioning
confidence: 99%
“…The parameter ν is shared with the main map (P.v). The map given by (Q.v) has the following degrees of iterates: 3,9,19,33,51,73,99,129,163 . .…”
Section: Maps (V) the Main Mapmentioning
confidence: 99%
“…called the algebraic entropy of the map ϕ When no confusion is possible about the map ϕ we will usually omit the subscript ϕ in (17). Algebraic entropy for bi-rational maps has the following properties [7,25,26]:…”
Section: Algebraic Entropymentioning
confidence: 99%
“…To practically compute the algebraic entropy we introduce some technical methods to reduce the computational complexity [26,27]. First, we fix the desired number of iterations to be some fixed N ∈ N. Following remark 3 this means that we need only finitely many initial conditions given by (15).…”
Section: Algebraic Entropymentioning
confidence: 99%