James D. Currie

activity

20232025

most citedThe repetition threshold for ternary rich words

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

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

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

James D. Currie

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

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…

Reduced complexities for sequences over finite alphabets

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

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

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

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