How many square occurrences must a binary sequence contain? (Q1871376)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How many square occurrences must a binary sequence contain? |
scientific article |
Statements
How many square occurrences must a binary sequence contain? (English)
0 references
7 May 2003
0 references
Summary: Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed that three distinct squares are necessary and sufficient to construct an infinite binary word. We study the following complementary question: how many 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....
0 references