Dejean's conjecture holds for N ≥ 27

DOI10.1051/ita/2009017zbMath1192.68497arXiv0901.3188OpenAlexW2170247267WikidataQ123123046 ScholiaQ123123046MaRDI QIDQ3653095

Narad Rampersad, James D. Currie

Publication date: 18 December 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.3188

zbMATH Keywords

Dejean's conjecturerepetitions in wordsfractional exponent

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (18)

A proof of Dejean’s conjecture ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ Growth of power-free languages over large alphabets ⋮ Minimal critical exponent of quasiperiodic words ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings ⋮ 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 ⋮ Growth properties of power-free languages ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ Bounds for the generalized repetition threshold ⋮ Last cases of Dejean's conjecture ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ On the growth rates of complexity of threshold languages ⋮ On the D0L Repetition Threshold ⋮ The repetition threshold for binary rich words ⋮ ON PANSIOT WORDS AVOIDING 3-REPETITIONS ⋮ The weak circular repetition threshold over large alphabets

Cites Work

• 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
• A proof of Dejean’s conjecture
• NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
• Repetitions in the Fibonacci infinite word
• Unnamed Item

This page was built for publication: Dejean's conjecture holds for N ≥ 27