SearcharxivSearch

arXiv · 1506.00233

Engel-type subgroups and length parameters of finite groups

Abstract

Let $g$ be an element of a finite group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots,g]$ over $x\in G$, where $g$ is repeated $n$ times. By Baer's theorem, if $E_n(g)=1$, then $g$ belongs to the Fitting subgroup $F(G)$. We generalize this theorem in terms of certain length parameters of $E_n(g)$. For soluble $G$ we prove that if, for some $n$, the Fitting height of $E_n(g)$ is equal to $k$, then $g$ belongs to the $(k+1)$th Fitting subgroup $F_{k+1}(G)$. For nonsoluble $G$ the results are in terms of nonsoluble length and generalized Fitting height. The generalized Fitting height $h^*(H)$ of a finite group $H$ is the least number $h$ such that $F^*_h(H)=H$, where $F^*_0(H)=1$, and $F^*_{i+1}(H)$ is the inverse image of the generalized Fitting subgroup $F^*(H/F^*_{i}(H))$. Let $m$ be the number of prime factors of $|g|$ counting multiplicities. It is proved that if, for some $n$, the generalized Fitting height of $E_n(g)$ is equal to $k$, then $g$ belongs to $F^*_{f(k,m)}(G)$, where $f(k,m)$ depends only on $k$ and $m$. The nonsoluble length $\lambda (H)$ of a finite group $H$ is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if $\lambda (E_n(g))=k$, then $g$ belongs to a normal subgroup whose nonsoluble length is bounded in terms of $k$ and $m$. We also state conjectures of stronger results independent of $m$ and show that these conjectures reduce to a certain question about automorphisms of direct products of finite simple groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Evgeny Khukhro, Pavel Shumyatsky. 2015-05-31. Engel-type subgroups and length parameters of finite groups. https://arxiv.org/abs/1506.00233

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