Narad Rampersad

 

Recent Submissions

  • Currie, James D.; Rampersad, Narad (Discrete Mathematics and Theoretical Computer Science, 2014-05-13)
    We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n .
  • Currie, James D.; Rampersad, Narad; Shallit, Jeffrey (The Electronic Journal of Combinatorics, 2006-09-22)
    We characterize the squares occurring in infinite overlap-free binary words and construct various α power-free binary words containing infinitely many overlaps.
  • Currie, James D.; Rampersad, Narad (The Electronic Journal of Combinatorics, 2008-08-31)
    The critical exponent of an infinite word w is the supremum of all rational numbers α such that w contains an α-power. We resolve an open question of Krieger and Shallit by showing that for each α>2 there is an infinite ...