2000 character limit reached
A Coloring Problem for Sturmian and Episturmian Words
Published 22 Jan 2013 in math.CO and cs.DM | (1301.5263v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
