SearcharxivSearch

arXiv · 1807.10624

Right Engel-type subgroups and length parameters of finite groups

Abstract

Let $g$ be an element of a finite group $G$ and let $R_{n}(g)$ be the subgroup generated by all the right Engel values $[g,{}_{n}x]$ over $x\in G$. In the case when $G$ is soluble we prove that if, for some $n$, the Fitting height of $R_{n}(g)$ is equal to $k$, then $g$ belongs to the $(k+1)$th Fitting subgroup $F_{k+1}(G)$. For nonsoluble $G$, it is proved that if, for some $n$, the generalized Fitting height of $R_n(g)$ is equal to $k$, then $g$ belongs to the generalized Fitting subgroup $F^*_{f(k,m)}(G)$ with $f(k,m)$ depending only on $k$ and $m$, where $|g|$ is the product of $m$ primes counting multiplicities. It is also proved that if, for some $n$, the nonsoluble length of $R_n(g)$ is equal to $k$, then $g$ belongs to a normal subgroup whose nonsoluble length is bounded in terms of $k$ and $m$. Earlier similar generalizations of Baer's theorem (which states that an Engel element of a finite group belongs to the Fitting subgroup) were obtained by the first two authors in terms of left Engel-type subgroups.

Explore related subjects

Keep this discovery

BibTeXRIS

E. I. Khukhro, P. Shumyatsky, G. Traustason. 2018-07-26. Right Engel-type subgroups and length parameters of finite groups. https://doi.org/10.1017/s1446788719000181

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