## Search

Now showing items 1-3 of 3

#### Cyclic Complexity of Some Infinite Words and Generalizations

(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

(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 ...

#### Words without Near-Repetitions

(Canadian Mathematical Society, 1992-06-01)

We find an infinite word w on four symbols with the following property: Two occurrences of any block in w must be separated by more than the length of the block. That is, in any subword of w of the form xyx, the length of ...