A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974)
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 2214845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof that a word of length \(n\) has at most \(2n\) distinct squares |
scientific article; zbMATH DE number 2214845 |
Statements
A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (English)
0 references
17 October 2005
0 references
combinatorics on words
0 references
squares
0 references
0.8954106569290161
0 references
0.8453916311264038
0 references
0.8257607221603394
0 references
0.8197752237319946
0 references
0.8041662573814392
0 references
