The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
From MaRDI portal
Publication:5109538
zbMath1442.68188arXiv1911.05779MaRDI QIDQ5109538
Narad Rampersad, L. A. S. Mól, James D. Currie
Publication date: 12 May 2020
Full work available at URL: https://arxiv.org/abs/1911.05779
Related Items (3)
Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Abelian repetition threshold revisited ⋮ The weak circular repetition threshold over large alphabets
Cites Work
- Growth properties of power-free languages
- Last cases of Dejean's conjecture
- Polynomial versus exponential growth in repetition-free binary words
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Overlap-free words and spectra of matrices
- Dejean's conjecture and Sturmian words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Growth of power-free languages over large alphabets
- Uniformly growing k-th power-free homomorphisms
- Dejean's conjecture holds for \(n\geq 30\)
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- On Pansiot Words Avoiding 3-Repetitions
- On Two Stronger Versions of Dejean’s Conjecture
- A proof of Dejean’s conjecture
- A generator of morphisms for infinite words
- Dejean's conjecture holds for N ≥ 27
- On the growth rates of complexity of threshold languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
