English

Solving the Babylonian Problem of quasiperiodic rotation rates

Dynamical Systems 2017-07-14 v3

Abstract

A trajectory un:=Fn(u0),n=0,1,2,u_n := F^n(u_0), n = 0,1,2, \dots is quasiperiodic if the trajectory lies on and is dense in some dd-dimensional torus, and there is a choice of coordinates on the torus T\mathbb{T} for which FF has the form F(θ)=θ+ρmod1F(\theta) = \theta + \rho\bmod1 for all θT\theta\in\mathbb{T} and for some ρT\rho\in\mathbb{T}. There is an ancient literature on computing three rotation rates ρ\rho for the Moon. %There is a literature on determining the coordinates of the vector ρ\rho, called the rotation rates of FF. (For d>1d>1 we always interpret mod1\bmod1 as being applied to each coordinate.) However, even in the case d=1d=1 there has been no general method for computing ρ\rho given only the trajectory unu_n, though there is a literature dealing with special cases. Here we present our Embedding Continuation Method for computing some components of ρ\rho from a trajectory. It is based on the Takens Embedding Theorem and the Birkhoff Ergodic Theorem. Rotation rates are often called "rotation numbers" and both refer to a rate of rotation of a circle. However, the coordinates of ρ\rho depend on the choice of coordinates of T\mathbb{T}. We explore the various sets of possible rotation rates that ρ\rho can yield. We illustrate our ideas with examples in dimensions d=1d=1 and 22.

Keywords

Cite

@article{arxiv.1706.02595,
  title  = {Solving the Babylonian Problem of quasiperiodic rotation rates},
  author = {Suddhasattwa Das and Yoshitaka Saiki and Evelyn Sander and James A Yorke},
  journal= {arXiv preprint arXiv:1706.02595},
  year   = {2017}
}