Multidimensional continued fractions and symbolic codings of toral translations
Publikationen: Beitrag in Fachzeitschrift › Artikel › Forschung › (peer-reviewed)
Standard
in: Journal of the European Mathematical Society, Jahrgang 25.2023, Nr. 123, 20.12.2022, S. 4997-5057.
Publikationen: Beitrag in Fachzeitschrift › Artikel › Forschung › (peer-reviewed)
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Multidimensional continued fractions and symbolic codings of toral translations
AU - Berthé, Valérie
AU - Steiner, Wolfgang
AU - Thuswaldner, Jörg
PY - 2022/12/20
Y1 - 2022/12/20
N2 - It has been a long standing problem to find good symbolic codings for translations on the d-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties. Inspired by Rauzy's approach we construct such codings in terms of multidimensional continued fraction algorithms that are realized by sequences of substitutions. In particular, given any exponentially convergent continued fraction algorithm, these sequences lead to renormalization schemes which produce symbolic codings of toral translations and bounded remainder sets at all scales in a natural way. The exponential convergence properties of a continued fraction algorithm can be viewed in terms of a Pisot type condition imposed on an attached symbolic dynamical system. Using this fact, our approach provides a systematic way to confirm purely discrete spectrum results for wide classes of symbolic dynamical systems. Indeed, as our examples illustrate, we are able to confirm the Pisot conjecture for many well-known families of sequences of substitutions. These examples comprise classical algorithms like the Jacobi--Perron, Brun, Cassaigne--Selmer, and Arnoux--Rauzy algorithms. As a consequence, we gain symbolic codings of almost all translations of the 2-dimensional torus having factor complexity 2n+1 that are balanced for words, which leads to multiscale bounded remainder sets. Using the Brun algorithm, we also give symbolic codings of almost all 3-dimensional toral translations having multiscale bounded remainder sets.
AB - It has been a long standing problem to find good symbolic codings for translations on the d-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties. Inspired by Rauzy's approach we construct such codings in terms of multidimensional continued fraction algorithms that are realized by sequences of substitutions. In particular, given any exponentially convergent continued fraction algorithm, these sequences lead to renormalization schemes which produce symbolic codings of toral translations and bounded remainder sets at all scales in a natural way. The exponential convergence properties of a continued fraction algorithm can be viewed in terms of a Pisot type condition imposed on an attached symbolic dynamical system. Using this fact, our approach provides a systematic way to confirm purely discrete spectrum results for wide classes of symbolic dynamical systems. Indeed, as our examples illustrate, we are able to confirm the Pisot conjecture for many well-known families of sequences of substitutions. These examples comprise classical algorithms like the Jacobi--Perron, Brun, Cassaigne--Selmer, and Arnoux--Rauzy algorithms. As a consequence, we gain symbolic codings of almost all translations of the 2-dimensional torus having factor complexity 2n+1 that are balanced for words, which leads to multiscale bounded remainder sets. Using the Brun algorithm, we also give symbolic codings of almost all 3-dimensional toral translations having multiscale bounded remainder sets.
U2 - 10.4171/JEMS/1300
DO - 10.4171/JEMS/1300
M3 - Article
VL - 25.2023
SP - 4997
EP - 5057
JO - Journal of the European Mathematical Society
JF - Journal of the European Mathematical Society
SN - 1435-9855
IS - 123
ER -