On Dejean's conjecture over large alphabets
From MaRDI portal
Publication:2456366
DOI10.1016/J.TCS.2007.06.001zbMATH Open1124.68087DBLPjournals/tcs/Carpi07OpenAlexW1997246838WikidataQ57253996 ScholiaQ57253996MaRDI QIDQ2456366FDOQ2456366
Authors: Arturo Carpi 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Uniformly growing k-th power-free homomorphisms
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Title not available (Why is that?)
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Sur un théorème de Thue
- Polynomial versus exponential growth in repetition-free binary words
- Dejean's conjecture and Sturmian words
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- A generalization of repetition threshold
- On the Repetition Threshold for Large Alphabets
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
Cited In (54)
- Title not available (Why is that?)
- On the existence of minimal \(\beta\)-powers
- Minimal critical exponent of quasiperiodic words
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- Branching frequency and Markov entropy of repetition-free languages
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
- Last cases of Dejean's conjecture
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Asymptotic repetitive threshold of balanced sequences
- The undirected repetition threshold and undirected pattern avoidance
- Bounds for the generalized repetition threshold
- Dejean's conjecture and letter frequency
- On minimal critical exponent of balanced sequences
- Growth rates of complexity of power-free languages
- Dejean's conjecture and letter frequency
- Title not available (Why is that?)
- Fractional meanings of nonrepetitiveness
- On repetition thresholds of caterpillars and trees of bounded degree
- \((2+\epsilon )\)-nonrepetitive list colouring of paths
- On the Repetition Threshold for Large Alphabets
- Counting maximal-exponent factors in words
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- Extensions and reductions of squarefree words
- Subword complexity and power avoidance
- AVOIDING APPROXIMATE SQUARES
- Nonrepetitive list colorings of the integers
- Dejean's conjecture holds for \(n\geq 30\)
- The weak circular repetition threshold over large alphabets
- A generalization of Thue freeness for partial words
- On a word avoiding near repeats
- On the growth rates of complexity of threshold languages
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
- Growth properties of power-free languages
- Repetition avoidance in products of factors
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
- Approaching repetition thresholds via local resampling and entropy compression
- A proof of Dejean’s conjecture
- On extremal properties of the Fibonacci word
- Extremal overlap-free and extremal \(\beta\)-free binary words
- Dejean's conjecture holds for N ≥ 27
- On Pnsiot words avoiding 3-repetitions
- Growth of power-free languages over large alphabets
- Critical exponent of infinite balanced words via the Pell number system
- Critical Exponents of Regular Arnoux-Rauzy Sequences
- On Abelian repetition threshold
- The repetition threshold for binary rich words
- Highly nonrepetitive sequences: winning strategies from the local Lemma
- Abelian repetition threshold revisited
- A small morphism for which the fixed point has an abelian critical exponent less than 2
- The repetition threshold of episturmian sequences
- Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
- Non-constructive upper bounds for repetition thresholds
This page was built for publication: On Dejean's conjecture over large alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456366)
