SearcharxivSearch

arXiv · 1810.10986

On the asymptotic behaviour of the number of Beauville and non-Beauville $p$-groups

Abstract

We find asymptotic lower bounds for the numbers of both Beauville and non-Beauville $2$-generator finite $p$-groups of a fixed order, which turn out to coincide with the best known asymptotic lower bound for the total number of $2$-generator finite $p$-groups of the same order. This shows that both Beauville and non-Beauville groups are abundant within the family of finite $p$-groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Gustavo A. Fernández-Alcober, Şükran Gül, Matteo Vannacci. 2018-10-25. On the asymptotic behaviour of the number of Beauville and non-Beauville $p$-groups. https://doi.org/10.1112/plms.12295

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