Complexity spectrum of some discrete dynamical systems

Details Complexity spectrum of some discrete dynamical systems Complexity spectrum of some discrete dynamical systems

1998-07-22

arxiv.org/abs/chao-dyn/9807031v1

Nonlinear Sciences

Chaotic Dynamics

1 LaTex file

Scientific paper

10.1016/S0167-2789(99)00014-7

We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities for all the $9!$ 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.

Affiliated with

Also associated with

No associations

Rating

Complexity spectrum of some discrete dynamical systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity spectrum of some discrete dynamical systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity spectrum of some discrete dynamical systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-451367