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 2023Show all

3 papers · 1 filter

math.CO2023

A small morphism giving Abelian repetition threshold less than 2

James D. Currie, Narad Rampersad

It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge al…

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…

cs.FL2023

The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold

James Currie, Narad Rampersad

We find the lexicographically least infinite binary rich word having critical exponent $2 + 2 /2$