Complexity spectrum of some discrete dynamical systems
arXiv:chao-dyn/9807031 · doi:10.1016/S0167-2789(99)00014-7
Abstract
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities for all the possible birational transformations. These complexities correspond to a spectrum of eighteen algebraic values. We then drastically generalize these results, replacing permutations of the entries by homogeneous polynomial transformations of the entries possibly depending on many parameters. Again it is shown that the associated birational, or even rational, transformations yield algebraic values for their complexities.
1 LaTex file
References in corpus (3)
Cited by in corpus (17)
- Symmetry, complexity and multicritical point of the two-dimensional spin glass
- Algebraic Entropy for lattice equations
- On the complexity of some birational transformations
- Let's Baxterise
- Real Arnold complexity versus real topological entropy for birational transformations
- Degree Complexity of a Family of Birational Maps
- Degree growth for tame automorphisms of an affine quadric threefold
- Real dynamics of a family of plane birational maps: trapping regions and entropy zero
- Post-critical set and non existence of preserved meromorphic two-forms
- Birational Mappings and Matrix Sub-algebra from the Chiral Potts Model
- Renormalization, isogenies and rational symmetries of differential equations
- Degree-growth of monomial maps
- A birational mapping with a strange attractor: Post critical set and covariant curves
- A central limit theorem for the degree of a random product of Cremona transformations
- On the Degree Growth of Birational Mappings in Higher Dimension
- Real and complex dynamics of a family of birational maps of the plane: the golden mean subshift
- Dynamics of a two parameter family of plane birational maps: maximal entropy