Related papers: Short words of infinite order

We construct finitely generated groups of small period growth, i.e. groups where the maximum order of an element of word length $n$ grows very slowly in $n$. This answers a question of Bradford related to the lawlessness growth of groups…

In this paper, we establish upper bounds on the length of the shortest conjugator between pairs of infinite order elements in a wide class of groups. We obtain a general result which applies to all hierarchically hyperbolic groups, a class…

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…

For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to…

We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

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…

We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…

We provide upper and lower bounds on the length of the shortest non-trivial element in the derived series and lower central series in the free group on two generators. The techniques are used to provide new estimates on the nilpotent…

A generalized lexicographic order on words is a lexicographic order where the total order of the alphabet depends on the position of the comparison. A generalized Lyndon word is a finite word which is strictly smallest among its class of…

We show that the free Burnside groups $B(m,n)$ are infinite for $m\geq 2$ and odd $n\geq 557$, the best currently known lower bound for the exponent. The proof uses iterated small cancellation theory where the induction is based on the…

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

Let $n,d \in \mathbb N$ and $w \in \mathbb F_n$ be non-trivial. We prove that the relatively free group of rank $d$ in the variety defined by the group law $w$ has a largest anabelian finite quotient and estimate its size. Here, a finite…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…