There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 (Q1856341)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 |
scientific article; zbMATH DE number 1862491
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 |
scientific article; zbMATH DE number 1862491 |
Statements
There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 (English)
0 references
13 May 2003
0 references
Summary: There are circular square-free words of length \(n\) on three symbols for \(n\geq 18\). This proves a conjecture of R. J. Simpson.
0 references
combinatorics on words
0 references
square-free words
0 references
