Exactness of the Euclidean algorithm and of the Rauzy induction on the space of interval exchange transfomations
Abstract
The two-dimensional homogeneous Euclidean algorithm is the central motivation for the definition of the classical multidimensional continued fraction algorithms, as Jacobi-Perron, Poincar\'e, Brun and Selmer algorithms. The Rauzy induction, a generalization of the Euclidean algorithm, is a key tool in the study of interval exchange transformations. Both maps are known to be dissipative and ergodic with respect to Lebesgue measure. Here we prove that they are exact.
0
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.