8 citations · 11 across the 5 of their papers we have counts for
17 papers · 1 filter
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…
Extremal overlap-free and extremal -free binary words
Lucas Mol, Narad Rampersad, Jeffrey Shallit
An overlap-free (or -free) word over a fixed alphabet is extremal if every word obtained from by inserting a single letter from at any position contains an overl…
The undirected repetition threshold and undirected pattern avoidance
James D. Currie, Lucas Mol
For a rational number such that , an undirected -power is a word of the form , where the word is nonempty, the word is in , and we have…
The Threshold Dimension and Irreducible Graphs
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
Let be a graph, and let , , and be vertices of . If the distance between and does not equal the distance between and , then is said to resolve $…
Lengths of extremal square-free ternary words
Lucas Mol, Narad Rampersad
A square-free word over a fixed alphabet is extremal if every word obtained from by inserting a single letter from (at any position) contains a square. Grytczuk et…