Reversible Christoffel factorizations

DOI10.1016/J.TCS.2013.05.042MaRDI QIDQ391135zbMATH OpenOpenAlexWikidataFDO

Authors Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni

Publication date 10 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Christoffel wordreversible Christoffel factorizationSturmain wordthree-interval exchange transformation

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two Sturmian words with the same language have (almost always) arbitrarily long Abelian equivalent prefixes. Using the three gap theorem, we prove that in each RC factorization, only 2 or 3 distinct Christoffel words may occur. We begin the study of such factorizations, considered as infinite words over 2 or 3 letters, and show that in the general case they are either Sturmian words, or obtained by a three-interval exchange transformation.

Recommendations

• Partitioned factors in Christoffel and Sturmian words
• scientific article; zbMATH DE number 772301
• Studies on finite Sturmian words
• On Christoffel classes
• Sturmian words and the Stern sequence

Cites work

• scientific article; zbMATH DE number 3153217 (Why is no real title available?)
• scientific article; zbMATH DE number 3057476 (Why is no real title available?)
• A characterization of Sturmian words by return words
• A remark on morphic sturmian words
• Coincidence for substitutions of Pisot type
• On Sturmian sequences which are invariant under some substitutions
• On an involution of Christoffel words and Sturmian morphisms
• On substitution invariant Sturmian words: an application of Rauzy fractals
• Return words in Sturmian and episturmian words
• Sturm numbers and substitution invariance of 3iet words
• Sturmian words, Lyndon words and trees
• Sturmian words: structure, combinatorics, and their arithmetics
• Three distance theorems and combinatorics on words

Cited in

(3)

• Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
• Matrix factorizations for reversible integer mapping
• A note on abelian returns in rotation words

This page was built for publication: Reversible Christoffel factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391135)