How many squares must a binary sequence contain? (Q1346736): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:30, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many squares must a binary sequence contain? |
scientific article |
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
