2020
DOI: 10.1007/978-3-030-57666-0_3
|View full text |Cite
|
Sign up to set email alerts
|

S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 95 publications
0
6
0
Order By: Relevance
“…Proof. Here we use a known relationship between the continued fraction expansion of α and first-return maps under a rotation by α [2,6,20]. Instead of starting with a circle (−1, 0] modulo 1, it is convenient to use (−1, α] modulo 1 + α, where α is "identified" with 0 by being the first image of 0 under the rotation by α.…”
Section: Further Remarksmentioning
confidence: 99%
See 1 more Smart Citation
“…Proof. Here we use a known relationship between the continued fraction expansion of α and first-return maps under a rotation by α [2,6,20]. Instead of starting with a circle (−1, 0] modulo 1, it is convenient to use (−1, α] modulo 1 + α, where α is "identified" with 0 by being the first image of 0 under the rotation by α.…”
Section: Further Remarksmentioning
confidence: 99%
“…This follows from the fact that (up to a reflection) the first-return map of a rotation by α 0 = α on a circle (−1, α 0 ] is a rotation by α 0 α 1 on the circle (−α 0 , α 0 α 1 ]; see e.g. Lemma 2.12 in [20]. After repeating this n times, the rotation is byᾱ n α n and the return map is to (−ᾱ n ,ᾱ n α n ].…”
Section: Further Remarksmentioning
confidence: 99%
“…The IETs are the good part since they behave well with induced transformations and admit continued fraction algorithms [8,44,52,54]. The bad part was much improved since then with various recent results using multidimensional continued fraction algorithms including Brun's algorithm [21] which provides measurable-theoretic conjugacy with symbolic systems for almost every toral rotations on T 2 [16,51]. As the authors wrote in [14], the term ugly "refers to some esthetic difficulties in building two-dimensional sequences by iteration of patterns".…”
Section: Introductionmentioning
confidence: 99%
“…Proof. Here we use a known relationship between the continued fractions expansion of α and first-return maps under a rotation by α [14,15,24]. Instead of starting with a circle (−1, 0] modulo 1, it is convenient to use (−1, α] modulo 1 + α, where α is "identified" with 0 by being the first image of 0 under the rotation by α.…”
mentioning
confidence: 99%
“…This follows from the fact that (up to a reflection) the first-return map of a rotation by α 0 = α on a circle (−1, α 0 ] is a rotation by α 0 α 1 on the circle (−α 0 , α 0 α 1 ]; see e.g. Lemma 2.12 in [24]. After repeating this n times, the rotation is by ᾱn α n and the return map is to (−ᾱ n , ᾱn α n ].…”
mentioning
confidence: 99%