Natural Sciences and Engineering Research Council of Canada
Indicators
851
Views
979
Downloads
Cubefree words with many squares
James Currie (1) (2), Narad Rampersad (1) (2)
(1) Department of Mathematics and Statistics [Winipeg]
(2) Department of Mathematics and Statistics [Winnipeg]
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.
