Last cases of Dejean's conjecture
From MaRDI portal
Publication:544887
DOI10.1016/j.tcs.2010.06.020zbMath1230.68163OpenAlexW2004336651WikidataQ57253998 ScholiaQ57253998MaRDI QIDQ544887
Publication date: 16 June 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.020
Thue-Morse sequenceinfinite wordfractional powerDejean's conjectureOchem's conjecturethreshold repetition
Related Items
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 ⋮ A proof of Dejean’s conjecture ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Avoiding letter patterns in ternary square-free words ⋮ 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 ⋮ Infinite words containing the minimal number of repetitions ⋮ 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 ⋮ Avoiding or Limiting Regularities in Words ⋮ 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 ⋮ On some generalizations of abelian power avoidability ⋮ 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 ⋮ On shuffling of infinite square-free words ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ Repetition avoidance in products of factors ⋮ Growth rates of complexity of power-free languages ⋮ 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 ⋮ Infinite binary words containing repetitions of odd period ⋮ Abelian repetition threshold revisited ⋮ The weak circular repetition threshold over large alphabets ⋮ Asymptotic repetitive threshold of balanced sequences ⋮ Rich square-free words
Cites Work
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Dejean's conjecture holds for \(n\geq 30\)
- Letter frequency in infinite repetition-free words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- Dejean's conjecture and letter frequency
