A coloring problem for Sturmian and episturmian words

DOI10.1007/978-3-642-38771-5_18MaRDI QIDQ5300840zbMATH OpenOpenAlexFDO

Authors Elena Pribavkina, Luca Q. Zamboni, Aldo De Luca

Publication date 28 June 2013

Published in Developments in Language Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word $w$, does there exist a finite coloring of its factors such that no factorization of $w$ is monochromatic? We show that such a coloring always exists whenever $w$ is a Sturmian word or a standard episturmian word.

Recommendations

• A coloring problem for infinite words
• Coloring problems for infinite words
• Monochromatic factorizations of words and periodicity
• A Ramsey characterisation of eventually periodic words
• On some variations of coloring problems of infinite words

Cited in

(8)

• Monochromatic factorizations of words and periodicity
• A Ramsey characterisation of eventually periodic words
• Subword complexity and Sturmian colorings of regular trees
• Continued fraction algorithm for Sturmian colorings of trees
• On some variations of coloring problems of infinite words
• On prefixal factorizations of words
• Coloring problems for infinite words
• A coloring problem for infinite words

This page was built for publication: A coloring problem for Sturmian and episturmian words

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