A Ramsey Characterisation of Eventually Periodic Words

TL;DR

This paper characterizes eventually periodic words through a Ramsey-theoretic property involving super-monochromatic factorizations under any finite coloring of finite words.

Contribution

It introduces a new characterization of eventually periodic words using super-monochromatic factorizations and proves a related Ramsey theorem involving alternating sums.

Findings

A word is eventually periodic if and only if every finite coloring admits a suffix with a super-monochromatic factorization.

A Ramsey theorem for alternating sums is established, which may be of independent interest.

The characterization extends previous results on periodicity and monochromatic factorizations.

Abstract

A factorisation $x = u_1 u_2 \cdots$ of an infinite word $x$ on alphabet $X$ is called `monochromatic', for a given colouring of the finite words $X^*$ on alphabet $X$, if each $u_i$ is the same colour. Wojcik and Zamboni proved that the word $x$ is periodic if and only if for every finite colouring of $X^*$ there is a monochromatic factorisation of $x$. On the other hand, it follows from Ramsey's theorem that, for \textit{any} word $x$, for every finite colouring of $X^*$ there is a suffix of $x$ having a monochromatic factorisation. A factorisation $x = u_1 u_2 \cdots$ is called `super-monochromatic' if each word $u_{k_1} u_{k_2} \cdots u_{k_n}$, where $k_1 < \cdots < k_n$, is the same colour. Our aim in this paper is to show that a word $x$ is eventually periodic if and only if for every finite colouring of $X^*$ there is a suffix of $x$ having a super-monochromatic factorisation. Our main tool is a Ramsey result about alternating sums that may be of independent interest.