3 papers
cs.FL2016
The Frobenius problem for the shuffle operation
Jeremy Nicholson, Narad Rampersad
We characterize the finite sets S of words such that that the iterated shuffle of S is co-finite and we give some bounds on the length of a longest word not in the iterated shuffle…
math.CO2015
Initial non-repetitive complexity of infinite words
Jeremy Nicholson, Narad Rampersad
The initial non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that a…
math.CO2015
Improved estimates for the number of privileged words
Jeremy Nicholson, Narad Rampersad
In combinatorics on words, a word w of length n over an alphabet of size q is said to be privileged if n <= 1 or if n >= 2 and w has a privileged border that occurs exactly twice i…