1. A SHORT PROOF THAT SHUFFLE SQUARES ARE 7-AVOIDABLE.
- Author
-
GUÉGAN, GUILLAUME and OCHEM, PASCAL
- Subjects
GRAPH coloring ,PROOF theory ,PATHS & cycles in graph theory ,POWER series ,GENERALIZATION ,COMBINATORICS - Abstract
A shuffle square is a word that can be partitioned into two identical words. We obtain a short proof that there exist exponentially many words over the 7 letter alphabet containing no shuffle square as a factor. The method is a generalization of the so-called power series method using ideas of the entropy compression method as developped by GonÇalves et al. [Entropy compression method applied to graph colorings. arXiv:1406.4380] [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF