9 citations · 47 across the 34 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.CO2009★ 2 cited
Recurrent words with constant Abelian complexity
James Currie, Narad Rampersad
We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al.
math.CO2009★ 9 cited
A proof of Dejean's conjecture
James Currie, Narad Rampersad
We prove Dejean's conjecture. Specifically, we show that Dejean's conjecture holds for the last remaining open values of n, namely 15 <= n <= 26.
cs.FL2009★ 2 cited
Lexicographically least words in the orbit closure of the Rudin-Shapiro word
James D. Currie
We give an effective characterization of the lexicographically least word in the orbit closure of the Rudin-Shapiro word w having a specified prefix. In particular, the lexicograph…