Abstract
We first study the iteration of birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of 3×3 matrices, and consider the degree d( n) of the numerators (or denominators) of the corresponding successive rational expressions for the nth iterate. The growth of this degree is (generically) exponential with n: d( n)≃ λ n . λ is called the growth complexity. We introduce a semi-numerical analysis which enables to compute these growth complexities λ for all the 9! possible birational transformations. These growth 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 growth complexities.
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call