A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:51, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof that a word of length \(n\) has at most \(2n\) distinct squares |
scientific article |
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
