Describing the Set of Words Generated by Interval Exchange Transformation

DOI10.1080/00927870903032932zbMath1200.37008arXiv0711.2374OpenAlexW3101599966MaRDI QIDQ3579923

Alexei Kanel-Belov, A. L. Chernyatiev

Publication date: 11 August 2010

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.2374

zbMATH Keywords

complexitycombinatorics on wordsinterval exchangelanguage of a shift

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10)

Related Items (8)

Specifying periodic words by restrictions ⋮ On cutting sequences of the \(L\)-shaped translation surface tiled by three squares ⋮ Order Conditions for Languages ⋮ Structure of \(K\)-interval exchange transformations: induction, trajectories, and distance theorems ⋮ Coding Non-orientable Laminations ⋮ Symbolic dynamics of piecewise contractions ⋮ Diagonal changes for surfaces in hyperelliptic components ⋮ Lamination languages

Cites Work

• Unnamed Item
• Sequences with subword complexity \(2n\)
• Sturmian words: structure, combinatorics, and their arithmetics
• Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
• Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• Well-balanced sequences
• Words with minimal growth function
• Languages of k -interval exchange transformations
• Poincaré recurrence and number theory
• Symbolic Dynamics II. Sturmian Trajectories
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Describing the Set of Words Generated by Interval Exchange Transformation