Cubefree words with many squares
James Currie, Narad Rampersad
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.
Full Text: PDF PostScript