James Currie ; Narad Rampersad - Cubefree words with many squares

dmtcs:486 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 3 - https://doi.org/10.46298/dmtcs.486
Cubefree words with many squaresArticle

Authors: James Currie ORCID1,2; Narad Rampersad ORCID1,2

  • 1 Department of Mathematics and Statistics [Winipeg]
  • 2 Department of Mathematics and Statistics [Winnipeg]

Automata, Logic and Semantics

[en]
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.

https://doi.org/10.46298/dmtcs.486
Source: HAL:hal-00990439v1
Volume: Vol. 12 no. 3
Section: Automata, Logic and Semantics
Published on: January 1, 2010
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] cubefree word, square
Funding:
    Source : OpenAIRE Graph
  • Funder: Natural Sciences and Engineering Research Council of Canada

Share and export

Consultation statistics

This page has been seen 608 times.
This article's PDF has been downloaded 556 times.