2002
DOI: 10.7146/math.scand.a-14363
|View full text |Cite
|
Sign up to set email alerts
|

Bratteli-Vershik models for Cantor minimal systems associated to interval exchange transformations

Abstract: We construct Bratteli-Vershik models for minimal interval exchange transformations. We use this to show that the interval exchange transformations over quadratic fields, recently studied by Boshernitzan and Carroll, actually are (conjugate to) substitution minimal systems. We also prove a partial converse to this. Furthermore, these systems are orbit equivalent to Sturmian systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
30
0
1

Year Published

2010
2010
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(35 citation statements)
references
References 9 publications
4
30
0
1
Order By: Relevance
“…Here we suggest constructions of universal graphs on which every automorphism can be realized as an adic shift. The study of specific automorphisms has already begun (see the survey [1], and also [2]), but, according to the conclusion of the paper [16] (see also below), the problem of classification of combinatorially definite filtrations is tame, i.e., there is a manageable space of classes, or orbits, or complete metric invariants of such filtrations (see the definition of combinatorial schemes of hierarchies below). This gives a chance to obtain a reasonable combinatorial classification of measure-preserving automorphisms.…”
Section: Metric Filtrations and Their Applicationsmentioning
confidence: 99%
“…Here we suggest constructions of universal graphs on which every automorphism can be realized as an adic shift. The study of specific automorphisms has already begun (see the survey [1], and also [2]), but, according to the conclusion of the paper [16] (see also below), the problem of classification of combinatorially definite filtrations is tame, i.e., there is a manageable space of classes, or orbits, or complete metric invariants of such filtrations (see the definition of combinatorial schemes of hierarchies below). This gives a chance to obtain a reasonable combinatorial classification of measure-preserving automorphisms.…”
Section: Metric Filtrations and Their Applicationsmentioning
confidence: 99%
“…Let S i k ⊂ R i k , S j k ⊂ R j k be two components of R k (S k ) and suppose that a left/right edge of R i k is identified to some right/left edge of R j k . We claim that we can connect S i k with S j k by a path γ k i,j : [0, 1] → S k (B, w ± , ≤ r,s ) which satisfies (25) min…”
Section: 21mentioning
confidence: 99%
“…Therefore, for any two sets S i k and S j k , if we can connect them by a path γ, using (25) and (26) {w ± (v)} and therefore justified our choice for δ t k in (19) for (3). We have showed why (21).…”
mentioning
confidence: 93%
See 1 more Smart Citation
“…В случае перекладываний отрезков такая последова-тельность башен получается, например, при индукции Рози-Вича; в результа-те мы получаем явное представление минимального перекладывания отрезков в виде автоморфизма Вершика (см. [25]). В следующем п.…”
Section: рис 4 атомы предельного распределенияunclassified