Monochromatic factorisations of words and periodicity
Ca\"ius Wojcik, Luca Q. Zamboni

TL;DR
This paper characterizes periodic infinite words by their monochromatic factorization properties under 2-colorings, linking combinatorial word structure with ultrafilter theory and the Stone-Cech compactification.
Contribution
It provides a complete characterization of periodicity of infinite words through monochromatic factorizations and ultrafilter existence, answering a longstanding question.
Findings
Periodic words admit monochromatic factorizations for all 2-colorings.
Non-periodic words lack such monochromatic factorizations for some 2-colorings.
The characterization connects word periodicity with ultrafilter properties in the Stone-Cech compactification.
Abstract
In 2006 T. Brown asked the following question: Given a non-periodic infinite word with values in a non-empty set does there exist a finite coloring relative to which does not admit a -monochromatic factorisation, i.e., a factorisation of the form with for all ? Various partial results in support of an affirmative answer to this question have appeared in the literature in recent years. In particular it is known that the question admits an affirmative answer for all non-uniformly recurrent words and various classes of uniformly recurrent words including Sturmian words. In this note we answer this question in general by showing that if is an infinite word with values in a non-empty set then is periodic if and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Mathematical Dynamics and Fractals · Geometric and Algebraic Topology
