Extremal overlap-free and extremal \(\beta\)-free binary words

DOI10.37236/9703zbMath1462.68151arXiv2006.10152OpenAlexW3112359435MaRDI QIDQ2215463

Narad Rampersad, L. A. S. Mól, Jeffrey O. Shallit

Publication date: 13 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.10152

zbMATH Keywords

overlap-free wordspower-free wordsextremal words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Lengths of irreducible and delicate words ⋮ Square-free extensions of words

Uses Software

• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Last cases of Dejean's conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• The origins of combinatorics on words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Chains and fixing blocks in irreducible binary sequences
• Dejean's conjecture holds for \(n\geq 30\)
• Extremal square-free words
• Circularly squarefree words and unbordered conjugates: a new approach
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A proof of Dejean’s conjecture
• A generator of morphisms for infinite words
• Dejean's conjecture holds for N ≥ 27
• Automatic Sequences

This page was built for publication: Extremal overlap-free and extremal \(\beta\)-free binary words