The lexicographically least binary rich word achieving the repetition threshold

DOI10.37236/12464MaRDI QIDQ6671609FDOQ6671609

Authors James D. Currie, Narad Rampersad

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)

Recommendations

• The repetition threshold for binary rich words
• Repetitions in infinite palindrome-rich words
• Rich square-free words
• A unique extension of rich words
• On the number of rich words

Cites work

• A proof of Dejean’s conjecture
• Avoidable patterns in strings of symbols
• BLOCKING SETS OF TERMS
• Extremal infinite overlap-free binary words
• Last cases of Dejean's conjecture
• On Abelian repetition threshold
• On balanced sequences and their critical exponent
• On minimal critical exponent of balanced sequences
• Palindromic richness
• Repetition threshold for circular words
• Repetitions in infinite palindrome-rich words
• Sur un théorème de Thue
• The analog of overlap-freeness for the period-doubling sequence
• The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
• The repetition threshold for binary rich words
• The undirected repetition threshold and undirected pattern avoidance
• Über unendliche Zeichenreihen.

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)