How many square occurrences must a binary sequence contain?

Gregory Kucherov 1 Pascal Ochem Michael Rao 2
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Every binary word with at least four letters contains a square. A.~Fraenkel and J.~Simpson \cite{FraenkelSimpson95} showed that three {\em distinct squares} are necessary and sufficient to construct an infinite binary word. We study the following complementary question: how many {\em square occurrences} must a binary word contain? We show that this quantity is, in the limit, a constant fraction of the word length, and prove that this constant is $0.55080...$.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00099596
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:39:07 AM
Last modification on : Monday, August 5, 2019 - 3:26:03 PM

Identifiers

  • HAL Id : inria-00099596, version 1

Collections

Citation

Gregory Kucherov, Pascal Ochem, Michael Rao. How many square occurrences must a binary sequence contain?. The Electronic Journal of Combinatorics, Open Journal Systems, 2003, 10 (1), 11 p. ⟨inria-00099596⟩

Share

Metrics

Record views

182