On the partitions with Sturmian-like refinements

DOI10.3934/dcds.2015.35.3483zbMath1317.37016arXiv1303.3387OpenAlexW3103479139MaRDI QIDQ2260736

Michal Kupsa, Štěpán Starosta

Publication date: 12 March 2015

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

local rulecoding of rotationSturmian subshiftfactor mappinglow-complexity systemsliding block-codeSturmian partitionToeplitz subshift

Mathematics Subject Classification ID

Combinatorics on words (68R15) Dynamical systems involving maps of the circle (37E10) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Three distance theorems and combinatorics on words
• Orbit equivalence and Kakutani equivalence with Sturmian subshifts
• Combinatoire des codages de rotations
• Trajectories of rotations
• Linearly recurrent subshifts have a finite number of non-periodic subshift factors
• An Introduction to Symbolic Dynamics and Coding
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: On the partitions with Sturmian-like refinements