OpenAlex ·

Almost all finite groups are $2$-groups of class two

Ning Su and Binzhou Xia

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.11092
Original
Read it at the publisher
Topics
CombinatoricsNumber Theory

Abstract

We prove that almost all finite groups are $2$-groups of nilpotency class two, when groups of order at most $x$ are counted up to isomorphism and $x\to\infty$. More precisely, uniformly for $2^m\leq x 0$. For each fixed prime $p$, we give a formula for the number of groups of order $p^m$, with relative error $O(p^{-m/3})$ as $m\to\infty$. This refines the classical logarithmic estimates for the number of $p$-groups. For every fixed prime $p$ and sufficiently large $m$, we also prove that all but a $p^{-m^2/300}$ proportion of groups of order $p^m$ have central elementary abelian Frattini subgroup. For fixed $p$, the distribution of the minimum number of generators among groups of order $p^m$ is asymptotically supported on one or two adjacent values, with explicit probabilities depending on $m$ modulo three.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics