Solving the Babylonian Problem of quasiperiodic rotation rates
Abstract
A trajectory un := Fn(u0), n = 0,1,2, … is quasiperiodic if the trajectory lies on and is dense in some d-dimensional torus, and there is a choice of coordinates on the torus T for which F has the form F(θ) = θ + 1 for all θ∈T and for some ∈T. There is an ancient literature on computing three rotation rates for the Moon. %There is a literature on determining the coordinates of the vector , called the rotation rates of F. (For d>1 we always interpret 1 as being applied to each coordinate.) However, even in the case d=1 there has been no general method for computing given only the trajectory un, though there is a literature dealing with special cases. Here we present our Embedding Continuation Method for computing some components of 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 depend on the choice of coordinates of T. We explore the various sets of possible rotation rates that can yield. We illustrate our ideas with examples in dimensions d=1 and 2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.