Square-free word

Over a binary alphabet ${\displaystyle \{0,1\}}$, the only squarefree words are the empty word ${\displaystyle \epsilon ,0,1,01,10,010}$, and ${\displaystyle 101}$.

Over a ternary alphabet ${\displaystyle \{0,1,2\}}$, there are infinitely many squarefree words. It is possible to count the number ${\displaystyle c(n)}$ of ternary squarefree words of length n.

The number of ternary squarefree words of length n[1]

n	0	1	2	3	4	5	6	7	8	9	10	11	12
${\displaystyle c(n)}$	1	3	6	12	18	30	42	60	78	108	144	204	264

This number is bounded by ${\displaystyle c(n)=\Theta (\alpha ^{n})}$, where ${\textstyle 1.3017597<\alpha <1.3017619}$.[2] The upper bound on ${\displaystyle \alpha }$ can be found via Fekete's Lemma and approximation by automata. The lower bound can be found by finding a substitution that preserves squarefreeness.[2]

Since there are infinitely many squarefree words over three-letter alphabets, this implies there are also infinitely many squarefree words over an alphabet with more than three letters.

The following table shows the exact growth rate of the k-ary squarefree words:

Consider a map ${\displaystyle {\textbf {w}}}$ from ${\displaystyle \mathbb {N} ^{2}}$ to A, where A is an alphabet and ${\displaystyle {\textbf {w}}}$ is called a 2-dimensional word. Let ${\displaystyle w_{m,n}}$ be the entry ${\displaystyle {\textbf {w}}(m,n)}$. A word ${\displaystyle {\textbf {x}}}$ is a line of ${\displaystyle {\textbf {w}}}$ if there exists ${\displaystyle i_{1},i_{2},j_{1},j_{2}}$such that ${\displaystyle {\text{gcd}}(j_{1},j_{2})=1}$, and for ${\displaystyle t\geq 0,x_{t}=w_{{i_{1}}+{j_{1}t},{i_{2}}+{j_{2}t}}}$.[3]

Carpi[4] proves that there exists a 2-dimensional word ${\displaystyle {\textbf {w}}}$ over a 16-letter alphabet such that every line of ${\displaystyle {\textbf {w}}}$ is squarefree. A computer search shows that there are no 2-dimensional words ${\displaystyle {\textbf {w}}}$over a 7-letter alphabet, such that every line of ${\displaystyle {\textbf {w}}}$ is squarefree.

Shur[5] proposes an algorithm called R2F (random-t(w)o-free) that can generate a squarefree word of length n over any alphabet with three or more letters. This algorithm is based on a modification of entropy compression: it randomly selects letters from a k-letter alphabet to generate a ${\displaystyle (k+1)}$-ary squarefree word.

algorithm R2F is
    input: alphabet size ${\displaystyle k\geq 2}$,
           word length ${\displaystyle n>1}$
    output: a ${\displaystyle (k+1)}$-ary squarefree word wof length n.

    (Note that ${\textstyle \color {gray}\Sigma _{k+1}}$ is the alphabet with letters ${\displaystyle \color {gray}\{1,...,k+1\}}$.)
    (For a word ${\displaystyle \color {gray}w\in \Sigma _{k}}$, ${\displaystyle \color {gray}\chi _{w}}$ is the permutation of ${\displaystyle \color {gray}\Sigma _{k}}$ such that a precedes b in ${\displaystyle \color {gray}\chi _{w}}$ if the 
     right most position of a in w is to the right of the rightmost position of b in w.
     For example,  ${\displaystyle \color {gray}w=136263163\in \Sigma _{6}}$ has ${\displaystyle \color {gray}\chi _{w}=361245}$.)

    choose ${\displaystyle w[1]}$ in ${\textstyle \Sigma _{k+1}}$ uniformly at random 
    set ${\displaystyle \chi _{w}}$ to ${\displaystyle w[1]}$ followed by all other letters of ${\textstyle \Sigma _{k+1}}$ in increasing order
    set the number N of iterations to 0

    while ${\displaystyle |w|<n}$ do
        choose j in ${\textstyle \Sigma _{k}}$ uniformly at random
        append ${\displaystyle a=\chi _{w}[j+1]}$ to the end of w
        update ${\displaystyle \chi _{w}}$ shifting the first j elements to the right and setting ${\displaystyle \chi _{w}[1]=a}$
        increment N by 1
        if w ends with an square of rank r then
            delete the last r letters of w

    return w

Every (k+1)-ary squarefree word can be the output of Algorithm R2F, because on each iteration it can append any letter except for the last letter of w.

The expected number of random k-ary letters used by Algorithm R2F to construct a ${\displaystyle (k+1)}$-ary squarefree word of length n is

$${\displaystyle N=n\left(1+{\frac {2}{k^{2}}}+{\frac {1}{k^{3}}}+{\frac {4}{k^{4}}}+O\left({\frac {1}{k^{5}}}\right)\right)+O(1).}$$

Note that there exists an algorithm that can verify the squarefreeness of a word of length n in ${\displaystyle O(n\log n)}$ time. Apostolico and Preparata[6] give an algorithm using suffix trees. Crochemore[7] uses partitioning in his algorithm. Main and Lorentz[8] provide an algorithm based on the divide-and-conquer method. A naive implementation may require ${\displaystyle O(n^{2})}$ time to verify the squarefreeness of a word of length n.

One example of an infinite squarefree word over an alphabet of size 3 is the word over the alphabet ${\displaystyle \{-1,0,+1\}}$ obtained by taking the first difference of the Thue–Morse sequence.[9] That is, from the Thue–Morse sequence

${\displaystyle 0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0...}$

one forms a new sequence in which each term is the difference of two consecutive terms of the Thue–Morse sequence. The resulting squarefree word is

${\displaystyle 1,0,-1,1,-1,0,1,0,-1,0,1,-1,1,0,-1,...}$(sequence A029883 in the OEIS).

Another example found by John Leech[10] is defined recursively over the alphabet ${\displaystyle \{0,1,2\}}$. Let ${\displaystyle w_{1}}$ be any squarefree word starting with the letter 0. Define the words ${\displaystyle \{w_{i}\mid i\in \mathbb {N} \}}$ recursively as follows: the word ${\displaystyle w_{i+1}}$ is obtained from ${\displaystyle w_{i}}$ by replacing each 0 in ${\displaystyle w_{i}}$ with 0121021201210, each 1 with 1202102012021, and each 2 with 2010210120102. It is possible to prove that the sequence converges to the infinite squarefree word

0121021201210120210201202120102101201021202102012021...

Infinite squarefree words can be generated by squarefree morphism. A morphism is called squarefree if the image of every squarefree word is squarefree. A morphism is called k–squarefree if the image of every squarefree word of length k is squarefree.

Crochemore[11] proves that a uniform morphism h is squarefree if and only if it is 3-squarefree. In other words, h is squarefree if and only if ${\displaystyle h(w)}$ is squarefree for all squarefree w of length 3. It is possible to find a squarefree morphism by brute-force search.

algorithm squarefree_morphism is
    output: a squarefree morphism with the lowest possible rank k.

    set ${\displaystyle k=3}$
    while True do
        set k_sf_words to the list of all squarefree words of length k over a ternary alphabet
        for each ${\displaystyle h(0)}$ in k_sf_words do
            for each ${\displaystyle h(1)}$ in k_sf_words do
                for each ${\displaystyle h(2)}$ in k_sf_words do
                    if ${\displaystyle h(1)=h(2)}$ then
                        break from the current loop (advance to next ${\displaystyle h(1)}$)
                    if ${\displaystyle h(0)\neq h(1)}$ and ${\displaystyle h(2)\neq h(0)}$ then
                        if ${\displaystyle h(w)}$ is squarefree for all squarefree w of length 3 then
                            return ${\displaystyle h(0),h(1),h(2)}$
        increment k by 1

Over a ternary alphabet, there are exactly 144 uniform squarefree morphisms of rank 11 and no uniform squarefree morphisms with a lower rank than 11.

To obtain an infinite squarefree words, start with any squarefree word such as 0, and successively apply a squarefree morphism h to it. The resulting words preserve the property of squarefreeness. For example, let h be a squarefree morphism, then as ${\displaystyle w\to \infty }$, ${\displaystyle h^{w}(0)}$ is an infinite squarefree word.

Note that, if a morphism over a ternary alphabet is not uniform, then this morphism is squarefree if and only if it is 5-squarefree.[11]

Over a ternary alphabet, a squarefree word of length more than 13 contains all the squarefree two-letter combinations.[12]

This can be proved by constructing a squarefree word without the two-letter combination ab. As a result, bcbacbcacbaca is the longest squarefree word without the combination ab and its length is equal to 13.

Note that over a more than three-letter alphabet there are squarefree words of any length without an arbitrary two-letter combination.

Over a ternary alphabet, a squarefree word of length more than 36 contains all the squarefree three-letter combinations.[12]

However, there are squarefree words of any length without the three-letter combination aba.

Note that over a more than three-letter alphabet there are squarefree words of any length without an arbitrary three-letter combination.

The density of a letter a in a finite word w is defined as ${\displaystyle {\frac {|w|_{a}}{|w|}}}$ where ${\displaystyle |w|_{a}}$ is the number of occurrences of a in ${\displaystyle w}$ and ${\displaystyle |w|}$ is the length of the word. The density of a letter a in an infinite word is ${\displaystyle \liminf _{l\to \infty }{\frac {|w_{l}|_{a}}{|w_{l}|}}}$ where ${\displaystyle w_{l}}$ is the prefix of the word w of length l.[13]

The minimal density of a letter a in an infinite ternary squarefree word is equal to ${\displaystyle {\frac {883}{3215}}}$.[13]

The maximum density of a letter a in an infinite ternary squarefree word is equal to ${\displaystyle {\frac {255}{653}}}$.[14]