The lexicographically least binary rich word achieving the repetition threshold

DOI10.37236/12464MaRDI QIDQ6671609FDOQ6671609

Narad Rampersad, James D. Currie

Publication date: 27 January 2025

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Avoidable patterns in strings of symbols
• BLOCKING SETS OF TERMS
• Palindromic richness
• On Abelian repetition threshold
• Extremal infinite overlap-free binary words
• Repetitions in infinite palindrome-rich words
• Sur un théorème de Thue
• A proof of Dejean’s conjecture
• Last cases of Dejean's conjecture
• The repetition threshold for binary rich words
• Repetition threshold for circular words
• The undirected repetition threshold and undirected pattern avoidance
• The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
• On balanced sequences and their critical exponent
• On minimal critical exponent of balanced sequences
• Über unendliche Zeichenreihen.
• Title not available (Why is that?)

This page was built for publication: The lexicographically least binary rich word achieving the repetition threshold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671609)