Avoiding 5/4-powers on the alphabet of nonnegative integers
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers. Specifically, we show that this word has the form p τ(φ(z) φ^2(z) ⋯) where p, z are finite words, φ is a 6-uniform morphism, and τ is a coding. This description yields a recurrence for the ith letter, which we use to prove that the sequence of letters is 6-regular with rank 188. More generally, we prove k-regularity for a sequence satisfying a recurrence of the same type.
READ FULL TEXT