Ten Squares Force an Overlap

Abstract

We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of squares.

Added quantification of a, b in Lemma 5