Exchange of three intervals: itineraries, substitutions and palindromicity
classification
🧮 math.CO
keywords
exchangethreeintervalsitinerarieswordsallowsapplycoding
read the original abstract
Given a symmetric exchange of three intervals, we provide a detailed description of the return times to a subinterval and the corresponding itineraries. We apply our results to morphisms fixing words coding non-degenerate three interval exchange transformation. This allows us to prove that the conjecture stated by Hof, Knill and Simon is valid for such infinite words.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.