Solvable Chaos
We present classes of discrete reversible systems which are at the same time chaotic and solvable.
arXiv subjects
Publications and source records attributed to C. -M. Viallet.
We present classes of discrete reversible systems which are at the same time chaotic and solvable.
For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the irreversibility of the map. We indicate how it can be exactly calculated.
We investigate global properties of the mappings entering the description of symmetries of integrable spin and vertex models, by exploiting their nature of birational transformations of projective spaces. We give an algorithmic analysis of the structure of invariants of such mappings. We discuss some characteristic conditions for their (quasi)--integrability, and in particular its links with their singularities (in the 2--plane). Finally, we describe some of their properties {\it qua\/} dynamical systems, making contact with Arnol'd's notion of complexity, and exemplify remarkable behaviours.