SearcharxivSearch

arXiv · 2502.05821

Probabilistic construction of some extremal $p$-groups

Abstract

A $p$-group $G$ is called *ab-maximal* if $|H : H'| < |G:G'|$ for every proper subgroup $H$ of $G$. Similarly, $G$ is called *$d$-maximal* if $d(H) < d(G)$ for every proper subgroup $H$ of $G$, where $d(H)$ is the minimal number of generators of $H$. If $G$ is ab-maximal then $|G:G'| \ge p^3 |G'|$, while if $G$ is $d$-maximal and $p \ne 2$ then $|G:G'| \ge p^2 |G'|$. Answering questions of Gonz\'alez-S\'anchez--Klopsch and Lisi--Sabatini, for all $p$ we construct infinitely many ab-maximal $p$-groups of class $2$ with $|G:G'| = p^3 |G'|$, and infinitely many $d$-maximal $p$-groups of class $2$ with $|G:G'| = p^2 |G'|$. The construction is probabilistic and based on the degeneracy of random alternating bilinear maps on subspaces. It is notable however that in the ab-maximal case we do not have a high-probability result but rather in a suitable sense the proportion of class-$2$ groups with $|G:G'| = p^n$ and $|G'| = p^{n-3}$ that are ab-maximal is close to $1/e$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean Eberhard, Luca Sabatini. 2025-02-09. Probabilistic construction of some extremal $p$-groups. https://doi.org/10.1016/j.jalgebra.2025.06.013

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