Cubefree words with many squares
Combinatorics
2009-04-14 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.0811.3233,
title = {Cubefree words with many squares},
author = {James Currie and Narad Rampersad},
journal= {arXiv preprint arXiv:0811.3233},
year = {2009}
}
Comments
6 pages