Search arXivSearch

arXiv · 1301.4093

Bounding the Exponent of a Verbal Subgroup

Abstract

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w only. We show that this is true in the case where w is either the nth Engel word or the word [x^n,y_1,y_2,...,y_k] (Theorem A). Further, we show that for any positive integer e there exists a number k=k(e) such that if w is a word and G is a finite group in which any nilpotent subgroup generated by products of k values of the word w has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w only (Theorem B).

Explore related subjects

Keep this discovery

BibTeXRIS

Eloisa Detomi, Marta Morigi, Pavel Shumyatsky. 2013-01-17. Bounding the Exponent of a Verbal Subgroup. https://arxiv.org/abs/1301.4093

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR