5-Abelian cubes are avoidable on binary alphabets

: Mercas R, Saarela A

Publisher: EDP Sciences

: 2014

: RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications

: RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

: RAIRO-Theor. Inf. Appl.

: 48

: 4

: 467

: 478

: 12

: 0988-3754

DOI: https://doi.org/10.1051/ita/2014020(external)

: http://www.rairo-ita.org/articles/ita/abs/2014/04/ita140019/ita140019.html(external)

A k-abelian cube is a word uvw, where the factors u, v, and w are either pairwise equal, or have the same multiplicities for every one of their factors of length at most k. Previously it has been shown that k-abelian cubes are avoidable over a binary alphabet for k >= 8. Here it is proved that this holds for k >= 5.

mesa14ita.pdf