The Limit of Repetition Thresholds of Rich Sequences
The Electronic Journal of Combinatorics · 24.04.2026 · 33 (2)
DOI: 10.37236/14600 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 24.04.2026. Verfasst von Lubomíra Dvořáková und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The repetition threshold of a class of sequences is the smallest number $r$ such that a~sequence from the class contains no repetition with exponent $> r$. We focus on the class~$\mathcal{C}_d$ of $d$-ary sequences rich in palindromes. In 2020, Currie, Mol, and Rampersad determined the repetition threshold for $\mathcal{C}_2$. In 2024, Currie, Mol and Peltomäki found the repetition threshold for $\mathcal{C}_3$ and conjectured that the repetition threshold for $\mathcal{C}_d$ tends to~2 with $d$ growing to infinity. Here we verify their conjecture.
Zitieren
APA
Dvořáková, L., & Pelantová, E. (2026). The Limit of Repetition Thresholds of Rich Sequences. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14600
Vancouver
Dvořáková L, Pelantová E. The Limit of Repetition Thresholds of Rich Sequences. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14600
BibTeX
@article{Dvokov2026,
author = {Dvořáková, Lubomíra and Pelantová, Edita},
title = {The Limit of Repetition Thresholds of Rich Sequences},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14600}
}
EUVIMED