Related papers: There are exponentially many ternary words that av…

We find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain…

This paper has been withdrawn by the author, due to an error in Proposition 2.2.

This paper has been withdrawn by the author due to a crucial argument error at p.10.

Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14,…

We study a new notion of cyclic avoidance of abelian powers. A finite word $w$ avoids abelian $N$-powers cyclically if for each abelian $N$-power of period $m$ occurring in the infinite word $w^\omega$, we have $m \geq |w|$. Let…

We construct an infinite binary word with critical exponent 3 that avoids abelian 4-powers. Our method gives an algorithm to determine if certain types of morphic sequences avoid additive powers. We also show that there are…

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…

This paper has been withdrawn by the author. The statement of the Main Theorem but is wrong in general, there have been provided counterexamples. The main theorem only holds conditionally, under the finiteness statement of theorem 2.8.

We enumerate all ternary length-l square-free words, which are words avoiding squares of words up to length l, for l<=24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds…

This paper has been withdrawn by the authors, due a crucial error in the proof of the main theorem.

This paper has been withdrawn by the author due to a mistake in the proof of the main theorem.

This paper has been withdrawn by the author due to a crucial error in the proof of Theorem 1.

We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered…

We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern $xyzxzyx$. In fact, we: (1) characterize all…

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth…

This paper has been withdrawn by the author due to a crucial error.

Paper withdrawn by the author.

This paper has been withdrawn by the authors due to a mistake in the proof of the chief result. In particular Theorem 1.3 is correct, while Theorem 1.1 and Theorem 1.2 hold with \mu>0 and a suitable restriction on the exponent p. The proof…

Two words $p$ and $q$ are avoided by the same number of length-$n$ words, for all $n$, precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theorem use generating functions but do not provide an explicit…