Cubefree words with many squares - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Cubefree words with many squares

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.

Keywords

Fichier principal
Vignette du fichier
1048-5078-1-PB.pdf (131.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990439 , version 1 (13-05-2014)

Identifiers

Cite

James Currie, Narad Rampersad. Cubefree words with many squares. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 3 (3), pp.29-34. ⟨10.46298/dmtcs.486⟩. ⟨hal-00990439⟩

Collections

TDS-MACS
24 View
748 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More