Interval exchanges, admissibility and branching Rauzy induction
RAIRO - Theoretical Informatics and Applications · 2017-07 · 51 (3) · 135-139
DOI: 10.1051/ita/2017004 ↗Kurz gefasst
Fachartikel in der Zeitschrift RAIRO - Theoretical Informatics and Applications, online erschienen am 12.04.2017. Verfasst von Francesco Dolce und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 28 Literaturangaben.
Abstract (Originalsprache)
We introduce a definition of admissibility for subintervals in interval exchange transformations. We characterize the admissible intervals using a branching version of the Rauzy induction. Using this notion, we prove a property of the natural codings of interval exchange transformations, namely that any derived set of a regular interval exchange set is a regular interval exchange set with the same number of intervals. Derivation is taken here with respect to return words. We also study the case of regular interval exchange transformations defined over a quadratic field and show that the set of factors of such a transformation is primitive morphic. The proof uses an extension of a result of Boshernitzan and Carroll.
Zitieren
APA
Dolce, F., & Perrin, D. (2017). Interval exchanges, admissibility and branching Rauzy induction. RAIRO - Theoretical Informatics and Applications, 51(3), 135-139. https://doi.org/10.1051/ita/2017004
Vancouver
Dolce F, Perrin D. Interval exchanges, admissibility and branching Rauzy induction. RAIRO - Theoretical Informatics and Applications. 2017;51(3):135-139. doi:10.1051/ita/2017004
BibTeX
@article{Dolce2017,
author = {Dolce, Francesco and Perrin, Dominique},
title = {Interval exchanges, admissibility and branching Rauzy induction},
journal = {RAIRO - Theoretical Informatics and Applications},
year = {2017},
volume = {51},
number = {3},
pages = {135--139},
doi = {10.1051/ita/2017004}
}
EUVIMED