Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (Q1184978): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57253993, #quickstatements; #temporary_batch_1712286835472 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sur un théorème de Thue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3083746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal flows arising from substitutions of non-constant length / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots / rank | |||
Normal rank |
Revision as of 16:15, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters |
scientific article |
Statements
Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (English)
0 references
28 June 1992
0 references
computer-aided proof
0 references
Dejean's conjecture
0 references