15 citations · 23 across the 7 of their papers we have counts for
7 papers · 1 filter
There are exponentially many ternary words that avoid abelian cubes
Narad Rampersad
This paper has been withdrawn by the author due to an error in the proof of Theorem 2.
Words avoiding reversed subwords
Narad Rampersad, Jeffrey Shallit
We examine words w satisfying the following property: if x is a subword of w and |x| is at least k for some fixed k, then the reversal of x is not a subword of w.
Words avoiding 7/3-powers and the Thue-Morse morphism
Narad Rampersad
In 1982, Seebold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue-Morse word and its complement. We strengthen Seebol…
A note on non-repetitive colourings of planar graphs
Narad Rampersad
Alon et al. introduced the concept of non-repetitive colourings of graphs. Here we address some questions regarding non-repetitive colourings of planar graphs. Specifically, we sho…
A note on avoidable words in squarefree ternary words
Narad Rampersad
We completely characterize the words that can be avoided in infinite squarefree ternary words.
Avoiding large squares in infinite binary words
Narad Rampersad, Jeffrey Shallit, Ming-wei Wang
We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y| >= 4; our…