SearcharxivSearch

arXiv · 2305.16254

On finite $d$-maximal groups

Abstract

Let $d$ be a positive integer. A finite group is called $d$-maximal if it can be generated by precisely $d$ elements, while its proper subgroups have smaller generating sets. For $d\in\{1,2\}$, the $d$-maximal groups have been classified up to isomorphism and only partial results have been proven for larger $d$. In this work, we prove that a $d$-maximal group is supersolvable and we give a characterization of $d$-maximality in terms of so-called maximal $(p,q)$-pairs. Moreover, we classify the maximal $(p,q)$-pairs of small rank obtaining, as a consequence, a full classification of the isomorphism classes of $3$-maximal finite groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Lucchini, Luca Sabatini, Mima Stanojkovski. 2023-05-25. On finite $d$-maximal groups. https://doi.org/10.1112/blms.12981

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