James D. Currie

collaborators

4 papers

math.CO2026

Words with factor complexity $2 n + 1$ and minimal critical exponent

James D. Currie

Word $G$ is the fixed point of the morphism $I^^{3} = [01, 2, 02]$ . In 2019, Shallit and Shur showed that $G$ has factor complexity $2 n + 1$ . They also showed that ${\mat…

math.CO2025

Low complexity binary words avoiding $(5/2)^{+}$ -powers

James Currie, Narad Rampersad

Rote words are infinite words that contain $2 n$ factors of length $n$ for every $n \geq 1$ . Shallit and Shur, as well as Ollinger and Shallit, showed that there are Rote words that…

math.CO2025

Reduced complexities for sequences over finite alphabets

John M. Campbell, James Currie, Narad Rampersad

Letting $w$ denote a finite, nonempty word, let $red (w)$ denote the word obtained from $w$ by replacing every subword $s$ of $w$ of the form $cc \dots c$ for a given charac…

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 $n$ contain $n$ distinc…

Words with factor complexity 2n+1 and minimal critical exponent

Low complexity binary words avoiding (5/2)+-powers

Reduced complexities for sequences over finite alphabets

The repetition threshold for ternary rich words

Words with factor complexity $2 n + 1$ and minimal critical exponent

Low complexity binary words avoiding $(5/2)^{+}$ -powers