Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alphabet |
3
|
| gptkbp:field |
theoretical computer science
combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Thue's Theorem
|
| gptkbp:implies |
There exist infinite square-free words over a 3-letter alphabet.
|
| gptkbp:influenced |
theory of formal languages
string algorithms |
| gptkbp:namedAfter |
gptkb:Axel_Thue
|
| gptkbp:publishedIn |
Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl.
|
| gptkbp:relatedTo |
combinatorics on words
pattern avoidance |
| gptkbp:state |
There exist infinite sequences over a finite alphabet that avoid certain repetitions.
|
| gptkbp:topic |
repetition-free sequences
square-free words |
| gptkbp:yearProposed |
1906
|
| gptkbp:bfsParent |
gptkb:Number_Theory
|
| gptkbp:bfsLayer |
7
|