On Avoiding Sufficiently Long Abelian Squares

Elyot Grant

A finite word $w$ is an abelian square if $w=x{x}^{\prime }$ with $x^{\prime }$ a permutation of $x$. In 1972, Entringer, Jackson, and Schatz proved that every binary word of length $k^2…