| Issue |
RAIRO-Theor. Inf. Appl.
Volume 50, Number 1, January-March 2016
Special issue dedicated to the 15th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 101 - 103 | |
| DOI | https://doi.org/10.1051/ita/2016007 | |
| Published online | 02 June 2016 | |
A short proof that shuffle squares are 7-avoidable
1
University Montpellier 2, LIRMM,
France
guegan@lirmm.fr
2
CNRS, LIRMM, Montpellier, France
ochem@lirmm.fr
Received:
24
March
2016
Accepted:
24
March
2016
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].
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / shuffle square / entropy compression
© EDP Sciences 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.