On the Repetition Threshold for Large Alphabets
From MaRDI portal
Recommendations
Cited in
(22)- Enumeration of irreducible binary words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Critical exponent of infinite balanced words via the Pell number system
- Letter frequency in infinite repetition-free words
- On Dejean's conjecture over large alphabets
- Finite-repetition threshold for infinite ternary words
- On two stronger versions of Dejean's conjecture
- Finite repetition threshold for large alphabets
- On the D0L Repetition Threshold
- On an efficient method for estimating the number of nonrepeating words
- scientific article; zbMATH DE number 4024387 (Why is no real title available?)
- scientific article; zbMATH DE number 851423 (Why is no real title available?)
- The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
- The repetition threshold for binary rich words
- Last cases of Dejean's conjecture
- Critical exponents of words over 3 letters
- Asymptotic repetitive threshold of balanced sequences
- Dejean's conjecture and letter frequency
- Fewest repetitions versus maximal-exponent powers in infinite binary words
- Counting maximal-exponent factors in words
- Dejean's conjecture and Sturmian words
- Every real number greater than 1 is a critical exponent
This page was built for publication: On the Repetition Threshold for Large Alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756719)
