A Coloring Problem for Sturmian and Episturmian Words

Autor:	de Luca, Aldo, Pribavkina, Elena V., Zamboni, Luca Q.
Rok vydání:	2013
Předmět:	Mathematics - Combinatorics Computer Science - Discrete Mathematics 68R15
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1301.5263 Zobrazit plný text záznamu View this record from Arxiv