arXiv Analytics

Sign in

arXiv:0711.2374 [math.DS]AbstractReferencesReviewsResources

Describing the set of words generated by interval exchange transformation

A. Ya. Belov, A. L. Chernyat'ev

Published 2007-11-15, updated 2008-01-31Version 2

Let $W$ be an infinite word over finite alphabet $A$. We get combinatorial criteria of existence of interval exchange transformations that generate the word W.

Comments: 17 pages, this paper was submitted at scientific council of MSU, date: September 21, 2007
Categories: math.DS, math.CO
Subjects: 37B10, 68R15
Related articles: Most relevant | Search more
arXiv:0711.3974 [math.DS] (Published 2007-11-26)
Remark to the paper Describing the set of words generated by interval exchange transformation, posted 15 November 2007
arXiv:1911.05547 [math.DS] (Published 2019-11-13)
A Convexity Criterion for Unique Ergodicity of Interval Exchange Transformations
arXiv:1104.5605 [math.DS] (Published 2011-04-29)
Inverse problems of symbolic dynamics

Links

Toolbox