2017
DOI: 10.1016/j.ejc.2017.01.003
|View full text |Cite
|
Sign up to set email alerts
|

Exchange of three intervals: Substitutions and palindromicity

Abstract: Given a symmetric exchange of three intervals, we provide a detailed description of the return times to a subinterval and the corresponding itineraries. We apply our results to morphisms fixing words coding non-degenerate three interval exchange transformation. This allows us to prove that the conjecture stated by Hof, Knill and Simon is valid for such infinite words.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
7
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1

Relationship

4
2

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 28 publications
1
7
0
Order By: Relevance
“…In [25], we confirm the conjecture for morphisms fixing a codings a non-degenerate exchange of 3 intervals. In [22], the authors prove the validity of the conjecture for marked morphisms.…”
Section: Open Questions and Related Problemssupporting
confidence: 72%
“…In [25], we confirm the conjecture for morphisms fixing a codings a non-degenerate exchange of 3 intervals. In [22], the authors prove the validity of the conjecture for marked morphisms.…”
Section: Open Questions and Related Problemssupporting
confidence: 72%
“…Both of these were proven in [12] for general interval exchange transformations with symmetric permutation and thus hold also for 3iets with permutation (321).…”
Section: Itineraries In Exchange Of Three Intervalsmentioning
confidence: 99%
“…We also focus on substitutions fixing words coding interval exchange transformations. The latter has implications [12] for the question of Hof, Knill and Simon [10] about palindromic substitution invariant words with application to aperiodic Schrödinger operators.…”
Section: Introductionmentioning
confidence: 99%
“…As mentioned in [18], the fixed point u = ψ(u) is again an image of a Sturmian word v under a morphism π : {0, 1} → {a, b, c} and the Sturmian word v itself is a fixed point of a morphism over binary alphabet {0, 1}. Since v is Sturmian, its defect is zero.…”
Section: Commentsmentioning
confidence: 99%