SearcharxivSearch

arXiv · 1706.02016

Classification and properties of the $π$-submaximal subgroups in minimal nonsolvable groups

Abstract

Let $π$ be a set of primes. According to H. Wielandt, a subgroup $H$ of a finite group $X$ is called a $π$-submaximal subgroup if there is a monomorphism $ϕ:X\rightarrow Y$ into a finite group $Y$ such that $X^ϕ$ is subnormal in $Y$ and $H^ϕ=K\cap X^ϕ$ for a $π$-maximal subgroup $K$ of $Y$. In his talk at the well-known conference on finite groups in Santa-Cruz (USA) in 1979, Wielandt posed a series of open questions and among them the following problem: to describe the $π$-submaximal subgroup of the minimal nonsolvable groups and to study properties of such subgroups: the pronormality, the intravariancy, the conjugacy in the automorphism group etc. In the article, for every set $π$ of primes, we obtain a description of the $π$-submaximal subgroup in minimal nonsolvable groups and investigate their properties, so we give a solution of Wielandt's problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenbin Guo, Danila Revin. 2017-06-07. Classification and properties of the $π$-submaximal subgroups in minimal nonsolvable groups. https://doi.org/10.1007/s13373-017-0112-y

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