Related papers: Abelian powers in paper-folding words
Abelian complexity of a word $\mathbf{u}$ is a function that counts the number of pairwise non-abelian-equivalent factors of $\mathbf{u}$ of length $n$. We prove that for any $c$-balanced Parry word $\mathbf{u}$, the values of the abelian…
In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or…
We provide an algebraic characterization of strong ordered Abelian groups: An ordered Abelian group is strong iff it has bounded regular rank and almost finite dimension. Moreover, we show that any strong ordered Abelian group has finite…
It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge alphabets. In this note we give a short cyclic morphism…
Two finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set…
We show that, for any prime $p$, there exist absolutely simple abelian varieties over $\mathbb{Q}$ with arbitrarily large $p$-torsion in their Tate-Shafarevich group. To prove this, we construct explicit $\mu_p$-covers of Jacobians of the…
Carpi (1993) and Lepisto (1994) proved independently that smooth words are cube-free for the alphabet {1, 2}, but nothing is known on whether for the other 2-letter alphabets, smooth words are k-power-free for some suitable positive integer…
We introduce the notion of a powerfully solvable group. These are powerful groups possessing an abelian series of a special kind. These groups include in particular the class of powerfully nilpotent groups. We will also see that for a…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
It is proved that any infinite Abelian topological group of prime exponent has an infinite maximally almost periodic subgroup.
We provide a complete characterisation of the appearance function for paper-folding sequences for factors of any length. We make use of the software package {\tt Walnut} to establish these results.
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 this work, we affirm the conjecture proposed by Gabriele Fici and Filippo Mignosi at the 10th Conference on Combinatorics on Words.
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…
We show that the coefficients of rational 2-functions are contained in an abelian number field. More precisely, we show that the poles of such functions are poles of order one and given by roots of unity and rational residue.
Abelian groups are classified by the existence of certain additive decompositions of group-valued functions of several variables with arity gap 2.
Fici and Saarela ([2]) conjectured that a binary word of length n contains at least $\lfloor n/4 \rfloor$ abelian squares. We slightly extend this conjecture and show that it holds in some special cases. In all other cases we have the…
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent $k$ for every $k > 0$. We improve on this result by studying the maximum exponents of…
In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our…
We investigate the large values of class numbers of cubic fields, showing that one can find arbitrary long sequences of "close" abelian cubic number fields with class numbers as large as possible. We also give a first step toward an…