2019
DOI: 10.3934/jcd.2019023
|View full text |Cite
|
Sign up to set email alerts
|

Linear degree growth in lattice equations

Abstract: We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth and hence are linearizable.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
(60 reference statements)
0
2
0
Order By: Relevance
“…We remark that some alternative degree equations equivalent to (53) are given in [30]. These equivalent forms prove useful for identifying and studying linearisable lattice equations.…”
Section: 2mentioning
confidence: 99%
“…We remark that some alternative degree equations equivalent to (53) are given in [30]. These equivalent forms prove useful for identifying and studying linearisable lattice equations.…”
Section: 2mentioning
confidence: 99%
“…The degree growth of a rational map has been used as a test of integrability, with linear growth associated with particularly simple dynamics. Tran and Roberts [31] establish linear degree growth for several families of mappings, and also find new quad graph mappings with linear growth.…”
mentioning
confidence: 99%