University of Winnipeg (515 Portage Avenue, Winnipeg, Manitoba , MB Canada R3B 2E9 - Canada)
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.
James Currie, Narad Rampersad. Cubefree words with many squares. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, Vol. 12 no. 3 (3), pp.29-34. ⟨10.46298/dmtcs.486⟩. ⟨hal-00990439⟩