Non-constructive upper bounds for repetition thresholds
From MaRDI portal
Publication:6661757
DOI10.1007/S00224-024-10187-7MaRDI QIDQ6661757
Publication date: 13 January 2025
Published in: Theory of Computing Systems (Search for Journal in Brave)
Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Application of entropy compression in pattern avoidance
- Generating square-free words efficiently
- Last cases of Dejean's conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Words strongly avoiding fractional powers
- Abelian repetition threshold revisited
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- The undirected repetition threshold and undirected pattern avoidance
- On shuffled-square-free words
- On Pnsiot words avoiding 3-repetitions
- On Abelian repetition threshold
- A proof of Dejean’s conjecture
- A short proof that shuffle squares are 7-avoidable
- A constructive proof of the general lovász local lemma
- New approach to nonrepetitive sequences
- Avoiding squares over words with lists of size three amongst four symbols
- On the growth rates of complexity of threshold languages
- Abelian squares are avoidable on 4 letters
- Über unendliche Zeichenreihen.
- Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
- Approaching repetition thresholds via local resampling and entropy compression
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)
