相关论文: Avoiding large squares in infinite binary words
In 2008, Kurosaki gave a new construction of a (bi-)infinite squarefree word over three letters. We show that in fact Kurosaki's word avoids 7/4+-powers, which, as shown by Dejean, is optimal over a 3-letter alphabet.
A word contains a \emph{half-flip} if it contains non-empty factors $uv$ and $vu$ where $|u|=|v|$. Fici reports a non-constructive proof of the existence of an infinite word over a finite alphabet avoiding half-flips and asks for the size…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
An overlap-free (or $\beta$-free) word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ at any position contains an overlap (or a factor of exponent at least $\beta$,…
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…
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…
We continue and generalise our earlier investigations of the number of squares in binary recurrence sequences. Here we consider sequences, $\left( y_{k} \right)_{k=-\infty}^{\infty}$, arising from the solutions of generalised negative Pell…
We find finite-state recurrences to enumerate the words on the alphabet $[n]^r$ which avoid the patterns 123 and $1k(k-1)\dots2$, and, separately, the words which avoid the patterns 1234 and $1k(k-1)\dots2$.
The method we have applied in "A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162" to count pattern avoiding permutations is adapted to words. As an…
An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary…
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…
We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special…
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word…
We study a question of Harju from 2019 regarding the existence of infinite ternary square-free words whose subsequences modulo $p$ and $q$ are also square-free for relatively prime integers $p$ and $q$. Among such pairs $(p, q)$ with $p, q…
We characterize the formulas that are avoided by every $\alpha$-free word for some $\alpha>1$. We study the avoidability index of formulas whose fragments are of the form $XYX$. The largest avoidability index of an avoidable palindrome…
In this paper we answer two recent questions from Charlier et al. and Harju about self-shuffling words. An infinite word $w$ is called self-shuffling, if $w=\prod_{i=0}^\infty U_iV_i=\prod_{i=0}^\infty U_i=\prod_{i=0}^\infty V_i$ for some…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
We show that the number of length-n words over a k-letter alphabet having no even palindromic prefix is the same as the number of length-n unbordered words, by constructing an explicit bijection between the two sets. A slightly different…
We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…