There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 (Q1856341): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 |
scientific article |
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
