James D. Currie

collaborators

3 papers

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

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.CO2023

The analogue of overlap-freeness for the Fibonacci morphism

James D. Currie, Narad Rampersad

A $4^{-}$ -power is a non-empty word of the form $X X X X^{-}$ , where $X^{-}$ is obtained from $X$ by erasing the last letter. A binary word is called {\em faux-bonacci} if it contains no $4…

Reduced complexities for sequences over finite alphabets

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

The analogue of overlap-freeness for the Fibonacci morphism

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