Non-constructive upper bounds for repetition thresholds
From MaRDI portal
Cites work
- A constructive proof of the general Lovász local lemma
- A proof of Dejean’s conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- A short proof that shuffle squares are 7-avoidable
- Abelian repetition threshold revisited
- Abelian squares are avoidable on 4 letters
- Application of entropy compression in pattern avoidance
- Approaching repetition thresholds via local resampling and entropy compression
- Avoiding squares over words with lists of size three amongst four symbols
- Generating square-free words efficiently
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Last cases of Dejean's conjecture
- New approach to nonrepetitive sequences
- On Abelian repetition threshold
- On Dejean's conjecture over large alphabets
- On Pnsiot words avoiding 3-repetitions
- On shuffled-square-free words
- On the growth rates of complexity of threshold languages
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Sur un théorème de Thue
- The undirected repetition threshold and undirected pattern avoidance
- Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
- Über unendliche Zeichenreihen.
- Words strongly avoiding fractional powers
This page was built for publication: Non-constructive upper bounds for repetition thresholds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661757)
