On Dejean's conjecture over large alphabets
From MaRDI portal
Publication:2456366
DOI10.1016/j.tcs.2007.06.001zbMath1124.68087OpenAlexW1997246838WikidataQ57253996 ScholiaQ57253996MaRDI QIDQ2456366
Publication date: 18 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.06.001
Related Items
Fractional meanings of nonrepetitiveness ⋮ Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters ⋮ Branching frequency and Markov entropy of repetition-free languages ⋮ A proof of Dejean’s conjecture ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ ON THE EXISTENCE OF MINIMAL β-POWERS ⋮ 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 ⋮ Critical Exponents of Regular Arnoux-Rauzy Sequences ⋮ 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 ⋮ 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 ⋮ On extremal properties of the Fibonacci word ⋮ Growth properties of power-free languages ⋮ AVOIDING APPROXIMATE SQUARES ⋮ 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 number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) ⋮ Dejean's conjecture holds for \(n\geq 30\) ⋮ Repetition avoidance in products of factors ⋮ On the growth rates of complexity of threshold languages ⋮ Growth rates of complexity of power-free languages ⋮ On a word avoiding near repeats ⋮ Nonrepetitive list colorings of the integers ⋮ Highly nonrepetitive sequences: Winning strategies from the local lemma ⋮ The repetition threshold for binary rich words ⋮ A generalization of Thue freeness for partial words ⋮ ON THE REPETITIVITY INDEX OF INFINITE WORDS ⋮ Dejean's conjecture and letter frequency ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial versus exponential growth in repetition-free binary words
- 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
- Uniformly growing k-th power-free homomorphisms
- Sur un théorème de Thue
- A generalization of repetition threshold
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
- On the Repetition Threshold for Large Alphabets
