Growth-complexity spectrum of some discrete dynamical systems (Q1809126): Difference between revisions

The authors study the iterations of birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of the \(3\times 3\) matricies and consider the degree \(d(n)\) of the numerators (or denominators) of the corresponding successive rational expressions of the \(n\)-th iterate. The growth of this degree is (generically) exponential with \(n\): \(d(n)=\lambda^n\), where \(\lambda\) is a growth-complexity. The seminumerical analysis which enables to compute this growth-complexity for all \(9!\) possible birational transformations are presented. The generalizations of these results by replacing the permutations of the entries by homogeneous polynomial transformations of the entries are also given.