Another Way to Lower the Bound for Distinct Squares

Eitatsu Tomita, Tomohiro I

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n…