39 citations · 86 across the 19 of their papers we have counts for
30 papers
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.
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…
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 …
Dyck Words, Pattern Avoidance, and Automatic Sequences
Lucas Mol, Narad Rampersad, Jeffrey Shallit
We study various aspects of Dyck words appearing in binary sequences, where is treated as a left parenthesis and as a right parenthesis. We show that binary words that are…
Antisquares and Critical Exponents
Aseem Baranwal, James Currie, Lucas Mol +3
The (bitwise) complement of a binary word is obtained by changing each in to and vice versa. An is a nonempty word of the form…
Extending Dekking's construction of an infinite binary word avoiding abelian -powers
James Currie, Lucas Mol, Narad Rampersad +1
We construct an infinite binary word with critical exponent 3 that avoids abelian 4-powers. Our method gives an algorithm to determine if certain types of morphic sequences avoid a…