The Tight Upper Bound on the Number of Distinct Squares in Circular Words

Rikuya Hamai

A square is a word $xx$, where $x$ is nonempty. We show that a circular word of length $n$ contains at most $\lfloor 3n/2\rfloor$ distinct squares of length at most $n$. The proof…