Abelian repetition threshold revisited
From MaRDI portal
Publication:2097234
DOI10.1007/978-3-031-09574-0_19OpenAlexW3199914805MaRDI QIDQ2097234
Elena A. Petrova, Arseny M. Shur
Publication date: 11 November 2022
Full work available at URL: https://arxiv.org/abs/2109.09306
Cites Work
- Unnamed Item
- Unnamed Item
- Last cases of Dejean's conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Branching frequency and Markov entropy of repetition-free languages
- Strongly non-repetitive sequences and progression-free sets
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Repetition threshold for circular words
- Words strongly avoiding fractional powers
- On balanced sequences and their asymptotic critical exponent
- Subword complexity and power avoidance
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- Critical exponents of infinite balanced words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- The undirected repetition threshold and undirected pattern avoidance
- On Abelian repetition threshold
- On Two Stronger Versions of Dejean’s Conjecture
- A proof of Dejean’s conjecture
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
- The repetition threshold for binary rich words
- Abelian squares are avoidable on 4 letters
- Shortest covers of all cyclic shifts of a string
This page was built for publication: Abelian repetition threshold revisited
