Related papers: Group Actions and Some Combinatorics on Words with…
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…
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…
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials.…
To study outer actions $\a$ of a group $G$ on a factor $\sM$ of type {\threel}, $0<\la<1$, we study first the cohomology group of a group with the unitary group of an abelian {\vna} as a coefficient group and establish a technique to reduce…
In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word $x\in A^N,$ over a non empty finite alphabet $A,$ contains at least $n+1$ distinct factors of each length $n.$ They further showed…
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…
Letting $w$ denote a finite, nonempty word, let $\text{red}(w)$ denote the word obtained from $w$ by replacing every subword $s$ of $w$ of the form $cc \cdots c$ for a given character $c$ (such that there is no character immediately to the…
Recently, a number of interesting relations have been discovered between generalised Pauli/Dirac groups and certain finite geometries. Here, we succeeded in finding a general unifying framework for all these relations. We introduce…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…
We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \geq 2$ and $m \geq 1$ as $\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}$, where $s_b(n)$ denotes the sum of digits in the base-$b$ representation of the…
We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…
In this paper we study the privileged complexity function of the Thue-Morse word. We prove a recursive formula describing this function, and using the formula we show that the function is unbounded and that the values of the function have…
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that -- the Thue-Morse word has the minimum possible subword complexity over all overlap-free…
Matrix elements in different representations are connected by quadratic relations. If matrix elements are those of a $\textit{group element}$, i.e. satisfying the property $\Delta(X) = X\otimes X$, then their generating functions obey…
Let X be a normal affine T-variety of complexity at most one over a perfect field k, where T stands for the split algebraic torus. Our main result is a classification of additive group actions on X that are normalized by the T-action. This…
Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power…
In this paper we undertake the general study of the Abelian complexity of an infinite word on a finite alphabet. We investigate both similarities and differences between the Abelian complexity and the usual subword complexity. While the…
In this paper we survey recent developments in the theory of groups acting on $\Lambda$-trees. We are trying to unify all significant methods and techniques, both classical and recently developed, in an attempt to present various faces of…