SearcharxivSearch

arXiv · 2607.06434

Finite groups with simple or $p$-nilpotent maximal subgroups

Abstract

Let $p$ be a prime number. When $p$ is odd, we study finite groups in which every maximal subgroup is either non-abelian simple or $p$-nilpotent, as well as those in which every maximal subgroup is either non-abelian simple or $p$-decomposable. We prove that every non-simple, non-solvable group satisfying the first condition is $p$-nilpotent, and every non-simple, non-solvable group satisfying the second condition is $p$-decomposable. In addition, we determine the possible occurrence of non-abelian simple maximal subgroups in these cases. These results provide a substantial partial answer to two questions posed by V.S. Monakhov and I.N. Tyutyanov in the Kourovka Notebook concerning the non-abelian composition factors of such groups. For non-abelian simple groups, we determine those satisfying the corresponding conditions within the alternating and sporadic families. The case of simple groups of Lie type is left open. Finally, for $p=2$, we obtain a complete classification of the non-solvable finite groups whose maximal subgroups are either non-abelian simple or $2$-nilpotent.

Explore related subjects

Keep this discovery

BibTeXRIS

Antonio Beltrán, Fernando Viudez. 2026-07-07. Finite groups with simple or $p$-nilpotent maximal subgroups. https://arxiv.org/abs/2607.06434

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