Linearisable Mappings and the Low-growth Criterion
نویسندگان
چکیده
We examine a family of discrete second-order systems which are integrable through reduction to a linear system. These systems were previously identified using the singularity confinement criterion. Here we analyse them using the more stringent criterion of nonexponential growth of the degrees of the iterates. We show that the linearisable mappings are characterised by a very special degree growth. The ones linearisable by reduction to projective systems exhibit zero growth, i.e. they behave like linear systems, while the remaining ones (derivatives of Riccati, Gambier mapping) lead to linear growth. This feature may well serve as a detector of integrability through linearisation.
منابع مشابه
The space of initial conditions for linearisable mappings
We apply the algebraic-geometric techniques developed for the study of mappings which have the singularity confinement property to mappings which are integrable through linearisation. The main difference with respect to the previous studies is that the linearisable mappings have generically unconfined singularities. Despite this fact we are able to provide a complete description of the dynamics...
متن کاملBlending two discrete integrability criteria : singularity confinement and algebraic entropy
We confront two integrability criteria for rational mappings. The first is the singularity confinement based on the requirement that every singu-larity, spontaneously appearing during the iteration of a mapping, disappear after some steps. The second recently proposed is the algebraic entropy criterion associated to the growth of the degree of the iterates. The algebraic entropy results confirm...
متن کاملFrom Integrable Lattices to Non-qrt Mappings
Second-order mappings obtained as reductions of integrable lattice equations are generally expected to have integrals that are ratios of biquadratic polynomials, i.e., to be of QRT-type. In this paper we find reductions of integrable lattice equations that are not of this type. The mappings we consider are exact reductions of integrable lattice equations proposed by Adler, Bobenko and Suris. Su...
متن کاملHow to Prove Algorithms Linearisable
Linearisability is the standard correctness criterion for concurrent data structures. In this paper, we present a sound and complete proof technique for linearisability based on backward simulations. We exemplify this technique by a linearisability proof of the queue algorithm presented in Herlihy and Wing’s landmark paper. Except for the manual proof by them, none of the many other current app...
متن کاملDynamic Limit Growth Indices in Discrete Time
We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a nancial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and su cient condition for a Dynamic Limit Growth Index to be a dynamic assessment index. We also establish their...
متن کامل