Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
From MaRDI portal
Publication:2420559
zbMath1429.68202arXiv1803.08145MaRDI QIDQ2420559
Narad Rampersad, James D. Currie, L. A. S. Mól
Publication date: 6 June 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.08145
Related Items (3)
Avoiding abelian powers cyclically ⋮ Abelian repetition threshold revisited ⋮ The weak circular repetition threshold over large alphabets
Cites Work
- Last cases of Dejean's conjecture
- On ternary square-free circular 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
- There exist binary circular \(5/2^+\) power free words of every length
- Uniformly growing k-th power-free homomorphisms
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Repetition threshold for circular words
- Dejean's conjecture holds for \(n\geq 30\)
- On Dejean's conjecture over large alphabets
- Attainable lengths for circular binary words avoiding \(k\) powers
- Sur un théorème de Thue
- A generalization of repetition threshold
- ON THE EXISTENCE OF MINIMAL β-POWERS
- Repetition thresholds for subdivided graphs and trees
- On Abelian repetition threshold
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- A generalization of Sylvester's and Frobenius' problems on numerical semigroups
This page was built for publication: Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
