Learn More
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet Σ k on k letters, an abelian square-free word is maximal if it cannot be extended to the left or right by letters from Σ k and remain abelian square-free. Michael Korn proved that the length (k) of a shortest maximal abelian(More)
  • 1