Avoidability of long $k$-abelian repetitions

Michaël Rao, Matthieu Rosenfeld

We study the avoidability of long $k$-abelian-squares and $k$-abelian-cubes on binary and ternary alphabets. For $k=1$, these are Mäkelä's questions. We show that one cannot avoid…