How many squares must a binary sequence contain? (Q1346736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 741557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How many squares must a binary sequence contain? |
scientific article; zbMATH DE number 741557 |
Statements
How many squares must a binary sequence contain? (English)
0 references
6 April 1995
0 references
Summary: Let \(g(n)\) be the length of a longest binary string containing at most \(n\) distinct squares (two identical adjacent substrings). Then \(g(0)=3\) (010 is such a string), \(g(1)= 7\) (0001000) and \(g(2)= 18\) (010011000111001101). How does the sequence \(\{g(n)\}\) behave? We give a complete answer.
0 references
length
0 references
longest binary string
0 references
distinct squares
0 references
0.7875806093215942
0 references
0.7839735746383667
0 references
0.7376464009284973
0 references
0.7343615889549255
0 references
0.7122779488563538
0 references
