Now showing items 1-2 of 2

    • Cyclic Complexity of Some Infinite Words and Generalizations 

      Krawchuk, Colin; Rampersad, Narad (Integers, 2018-03)
      Cassaigne et al. introduced the cyclic complexity function c_x(n), which gives the number of cyclic conjugacy classes of length-n factors of a word x. We study the behavior of this function for the Fibonacci word f and the ...
    • Infinite words containing squares at every position 

      Currie, James; Rampersad, Narad (EDP Sciences, 2010)
      Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there exists an infinite word that avoids α-powers but contains arbitrarily large squares beginning at every position? We resolve ...