Related papers: Abelian powers in paper-folding words
An abelian anti-power of order $k$ (or simply an abelian $k$-anti-power) is a concatenation of $k$ consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion…
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian…
We investigate Abelian primitive words, which are words that are not Abelian powers. We show that unlike classical primitive words, the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive…
This paper concerns the avoidability of abelian and additive powers in infinite rich words. In particular, we construct an infinite additive $5$-power-free rich word over $\{0,1\}$ and an infinite additive $4$-power-free rich word over…
We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps.
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian…
We consider partial words with a unique position starting a power. We show that over a $k$ letter alphabet, a partial word with a unique position starting a square can contain at most $k$ squares. This is in contrast to full words which can…
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 prove control theorems for abelian varieties over function fields.
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on…
In this paper we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection.…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
In this paper we determine all finitely generated abelian groups which are varietal capable with respect to the variety of polynilpotent groups. This result is a vast generalization of the famous Baer's result about capability of finitely…
We present and discuss a number of known results and open problems abelian squares in words on small alphabets.
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words,…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…