pith. sign in

arxiv: 1510.00723 · v4 · pith:JMNNXEUMnew · submitted 2015-10-02 · 🧮 math.DS · cs.DM

Degree of recurrence of generic diffeomorphisms

classification 🧮 math.DS cs.DM
keywords discretizationsdynamicalgenericpossiblealgorithmcasecomputeconservative
0
0 comments X
read the original abstract

We study spatial discretizations of dynamical systems: is it possible to recover some dynamical features of a system from numerical simulations? Here, we tackle this issue for the simplest algorithm possible: we compute long segments of orbits with a fixed number of digits. We show that for every $r\ge 1$, the dynamics of the discretizations of a $C^r$ generic conservative diffeomorphism of the torus is very different from that observed in the $C^0$ regularity. The proof of our results involves in particular a local-global formula for discretizations, as well as a study of the corresponding linear case, which uses ideas from the theory of quasicrystals.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.