A coloring problem for infinite words

DOI10.1016/j.jcta.2014.03.009zbMath1295.05256arXiv1307.2828OpenAlexW1996213123MaRDI QIDQ2451905

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

Publication date: 26 May 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Sturmian wordsRamsey theoryfactor complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Ramsey theory (05D10)

Related Items (7)

On some variations of coloring problems of infinite words ⋮ On prefixal factorizations of words ⋮ Monochromatic arithmetic progressions in automatic sequences with group structure ⋮ MONOCHROMATIC FACTORIZATIONS OF WORDS AND PERIODICITY ⋮ Coloring Problems for Infinite Words ⋮ Coloring factors of substitutive infinite words ⋮ Monochromatic arithmetic progressions in binary Thue-Morse-like words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite Lyndon words
• A characterization of substitutive sequences using return words
• Well-balanced sequences
• Episturmian words and episturmian morphisms
• Digital straightness -- a review
• Automatic Sequences
• A Coloring Problem for Sturmian and Episturmian Words
• Self-shuffling Words
• A characterization of Sturmian words by return words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: A coloring problem for infinite words