A Coloring Problem for Sturmian and Episturmian Words
arXiv:1301.5263
Abstract
We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word , does there exist a finite coloring of its factors such that no factorization of is monochromatic? We show that such a coloring always exists whenever is a Sturmian word or a standard episturmian word.