COMBINATORICS
2004
13 years 11 months ago
2004
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 squarefree word is max...