9 citations · 19 across the 17 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
On some problems of Harju concerning squarefree arithmetic progressions in infinite words
James Currie, Narad Rampersad
In a recent paper, Harju posed three open problems concerning square-free arithmetic progressions in infinite words. In this note we solve two of them.
math.CO2018
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture
James D. Currie, Lucas Mol, Narad Rampersad
A word is called -free if it has no factors of exponent greater than or equal to . The repetition threshold is the infimum of the set of all such that th…