3 papers
math.CO2026
Critical exponent of ternary words with few distinct palindromes
ĽubomÃra DvoÅáková, Lucas Mol, Pascal Ochem
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.
math.CO2025
The repetition threshold for ternary rich words
James D. Currie, Lucas Mol, Jarkko Peltomäki
In 2017, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length contain distinc…
math.CO2025
Avoiding abelian and additive powers in rich words
Jonathan Andrade, Lucas Mol
This paper concerns the avoidability of abelian and additive powers in infinite rich words. In particular, we construct an infinite additive -power-free rich word over …