Full-deautonomisation of a lattice equation
arXiv:1603.00152 · doi:10.1088/1751-8113/49/28/28LT01
Abstract
In this letter we report on the unexpected possibility of applying the full-deautonomisation approach we recently proposed for predicting the algebraic entropy of second-order birational mappings, to discrete lattice equations. Moreover, we show, on two examples, that the full-deautonomisation technique can in fact also be successfully applied to reductions of these lattice equations to mappings with orders higher than 2. In particular, we apply this technique to a recently discovered lattice equation that has confined singularities while being nonintegrable, and we show that our approach accurately predicts this nonintegrable character. Finally, we demonstrate how our method can even be used to predict the algebraic entropy for some nonconfining higher order mappings.
arXiv comment11 pages, 2 figures
References in corpus (10)
- Algebraic entropy
- Singularity confinement and chaos in discrete systems
- Algebraic entropy and the space of initial values for discrete dynamical systems
- Algebraic Entropy for lattice equations
- Investigation into the role of the Laurent property in integrability
- Bilinearization and Casorati determinant solution to the non-autonomous discrete KdV equation
- Singularity confinement and full-deautonomisation: a discrete integrability criterion
- Deautonomisation by singularity confinement: an algebro-geometric justification
- Algebraic entropy of an extended Hietarinta-Viallet equation
- Singularity confinement and chaos in two-dimensional discrete systems