Existence of an infinite ternary 64-abelian square-free word
We consider a recently defined notion of of words by concentrating on avoidance problems. The equivalence class of a word depends on the numbers of occurrences of different factors of length for a fixed natural number and the prefix of the word. We have shown earlier that over a ternary alphabet -abelian squares cannot be avoided in pure morphic words for any natural number . Nevertheless, computational experiments support the conjecture that even 3-abelian squares can be avoided...