SearcharxivSearch

arXiv · 1310.2434

Nonsoluble and non-p-soluble length of finite groups

Abstract

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $λ(G)$ as the minimum number of nonsoluble factors in a series of this kind. Upper bounds for $λ(G)$ appear in the study of various problems on finite, residually finite, and profinite groups. We prove that $λ(G)$ is bounded in terms of the maximum $2$-length of soluble subgroups of $G$, and that $λ(G)$ is bounded by the maximum Fitting height of soluble subgroups. For an odd prime $p$, the non-$p$-soluble length $λ_p(G)$ is introduced, and it is proved that $λ_p(G)$ does not exceed the maximum $p$-length of $p$-soluble subgroups. We conjecture that for a given prime $p$ and a given proper group variety ${\frak V}$ the non-$p$-soluble length $λ_p(G)$ of finite groups $G$ whose Sylow $p$-subgroups belong to ${\frak V}$ is bounded. In this paper we prove this conjecture for any variety that is a product of several soluble varieties and varieties of finite exponent.

Explore related subjects

Keep this discovery

BibTeXRIS

E. I. Khukhro, P. Shumyatsky. 2014-09-01. Nonsoluble and non-p-soluble length of finite groups. https://arxiv.org/abs/1310.2434

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