A coloring problem fo Sturmian and episturmian words

Autor: DE LUCA, ALDO, E. PRIBAVKINA, L. ZAMBONI

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3730::623aff805cb65085aa57b8ac776aaa5d
http://hdl.handle.net/11588/567051

A coloring problem for infinite words

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

Publikováno v: Journal of Combinatorial Theory, Series A
Journal of Combinatorial Theory, Series A, Elsevier, 2014, 125, pp.306-332
Journal of Combinatorial Theory. Series A

In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no factorization of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66c21a5184c437b48167630631431d01
https://hal.archives-ouvertes.fr/hal-01024879