Dejean's conjecture holds for \(n\geq 30\)
From MaRDI portal
Publication:2271427
DOI10.1016/j.tcs.2009.01.026zbMath1173.68050arXiv0806.0043WikidataQ123155488 ScholiaQ123155488MaRDI QIDQ2271427
Narad Rampersad, James D. Currie
Publication date: 7 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.0043
Related Items
The weak circular repetition threshold over large alphabets, The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$, Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings, Minimal critical exponent of quasiperiodic words, Last cases of Dejean's conjecture, On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters, On repetition thresholds of caterpillars and trees of bounded degree, Fractional meanings of nonrepetitiveness, Extremal overlap-free and extremal \(\beta\)-free binary words, On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\), Infinite binary words containing repetitions of odd period, Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture, On the D0L Repetition Threshold, Highly nonrepetitive sequences: Winning strategies from the local lemma, A proof of Dejean’s conjecture, Dejean's conjecture holds for N ≥ 27
Cites Work
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- On critical exponents in fixed points of non-erasing morphisms
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Uniformly growing k-th power-free homomorphisms
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A generalization of repetition threshold
- Repetitions in the Fibonacci infinite word
