Related papers: Avoiding conjugacy classes on the 5-letter alphabe…
Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…
We provide an example of a finite group with a conjugacy class of average size on which fewer than half of the irreducible characters are either zero or a root of unity.
For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively,…
Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular…
We study the properties of the ternary infinite word p = 012102101021012101021012 ... , that is, the fixed point of the map h:0->01, 1->21, 2->0. We determine its factor complexity, critical exponent, and prove that it is 2-balanced. We…
In this paper, we derive an asymptotic formula for the number of conjugacy classes of elements in a class of statistically convex-cocompact actions with contracting elements. Denote by $\mathcal C(o, n)$ (resp. $\mathcal C'(o, n)$) the set…
We establish the existence of two rigid triples of conjugacy classes in the algebraic group $G_{2}$ in characteristic $5$, complementing results of the second author with Liebeck and Marion. As a corollary, the finite groups $G_{2}(5^n)$…
Let w be a group word. It is conjectured that if w has only countably many values in a profinite group G, then the verbal subgroup w(G) is finite. In the present paper we confirm the conjecture in the cases where w is a multilinear…
Let $W$ be an infinite word over finite alphabet $A$. We get combinatorial criteria of existence of interval exchange transformations that generate the word W.
We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word $w$ of length $n$ over an alphabet of cardinality $k$, $w$ can be…
We study the (variable-length) codes of the form X u {a^n}, where X c a*wa* and |X| = n. We extend various notions and results from factorizations of cyclic groups theory to this type of codes. In particular, when n is the product of at…
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely…
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary…
Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a…
A word $w$ is said to be closed if it has a proper factor $x$ which occurs exactly twice in $w$, as a prefix and as a suffix of $w$. Based on the concept of Ziv-Lempel factorization, we define the closed $z$-factorization of finite and…
Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+sqrt(5))/4. Over larger alphabets, we give…
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…
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…
Given a bi-order $\succ$ on the free group $\mathcal{F}$, we show that every non-periodic cyclically reduced word $W\in \mathcal{F}$ admits a maximal ascent that is uniquely positioned. This provides a cyclic permutation of $W'$ that…
The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\'a together…