Abstract : We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.
https://hal.inria.fr/hal-00990439
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mardi 13 mai 2014 - 15:37:08
Dernière modification le : lundi 15 janvier 2018 - 15:46:01
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:15:56
James Currie, Narad Rampersad. Cubefree words with many squares. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.29-34. 〈hal-00990439〉
