arXiv Analytics

Sign in

arXiv:1301.5263 [math.CO]AbstractReferencesReviewsResources

A Coloring Problem for Sturmian and Episturmian Words

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

Published 2013-01-22Version 1

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.

Related articles: Most relevant | Search more
arXiv:2408.00815 [math.CO] (Published 2024-08-01)
On a Problem of Ramsey Theory
arXiv:1307.2828 [math.CO] (Published 2013-07-10, updated 2014-03-25)
A Coloring Problem for Infinite Words
arXiv:1505.08162 [math.CO] (Published 2015-05-29)
Dimension and cut vertices: an application of Ramsey theory