A proof of Dejean’s conjecture
From MaRDI portal
Publication:3168740
DOI10.1090/S0025-5718-2010-02407-XzbMath1215.68192arXiv0905.1129OpenAlexW2148206455WikidataQ57253997 ScholiaQ57253997MaRDI QIDQ3168740
Narad Rampersad, James D. Currie
Publication date: 19 April 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.1129
Related Items (49)
Fractional meanings of nonrepetitiveness ⋮ Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters ⋮ The critical exponent functions ⋮ Branching frequency and Markov entropy of repetition-free languages ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Fewest repetitions in infinite binary words ⋮ On Abelian repetition threshold ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ Growth of power-free languages over large alphabets ⋮ On minimal critical exponent of balanced sequences ⋮ Minimal critical exponent of quasiperiodic words ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Approaching repetition thresholds via local resampling and entropy compression ⋮ Interview with Jeffrey Shallit ⋮ Abelian combinatorics on words: a survey ⋮ Critical Exponents of Regular Arnoux-Rauzy Sequences ⋮ Computing maximal-exponent factors in an overlap-free word ⋮ Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings ⋮ Extensions and reductions of squarefree words ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ Avoidance of split overlaps ⋮ Extremal overlap-free and extremal \(\beta\)-free binary words ⋮ On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ Growth properties of power-free languages ⋮ Avoiding abelian powers cyclically ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Lower-bounds on the growth of power-free languages over large alphabets ⋮ On avoidability of formulas with reversal ⋮ Efficient computation of maximal anti-exponent in palindrome-free strings ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ Bounds for the generalized repetition threshold ⋮ Last cases of Dejean's conjecture ⋮ On shuffling of infinite square-free words ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ On the growth rates of complexity of threshold languages ⋮ Growth rates of complexity of power-free languages ⋮ On the D0L Repetition Threshold ⋮ Nonrepetitive list colorings of the integers ⋮ Highly nonrepetitive sequences: Winning strategies from the local lemma ⋮ Nonrepetitive and pattern-free colorings of the plane ⋮ The repetition threshold for binary rich words ⋮ Dejean's conjecture holds for N ≥ 27 ⋮ ON PANSIOT WORDS AVOIDING 3-REPETITIONS ⋮ Subword complexity and power avoidance ⋮ Abelian repetition threshold revisited ⋮ The weak circular repetition threshold over large alphabets ⋮ Asymptotic repetitive threshold of balanced sequences ⋮ Rich square-free words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Last cases of Dejean's conjecture
- 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
- Dejean's conjecture holds for \(n\geq 30\)
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A generalization of repetition threshold
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- Dejean's conjecture holds for N ≥ 27
- Repetitions in the Fibonacci infinite word
- On the growth rates of complexity of threshold languages
This page was built for publication: A proof of Dejean’s conjecture
