Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.02219

Counting conjugacy classes of subgroups of ${\rm PSL}_2(p)$

Gareth A. Jones
View original source ↗Read source document ↗Export metadata ↓

Abstract

We obtain formulae for the numbers of isomorphism and conjugacy classes of non-identity proper subgroups of the groups $G={\rm PSL}_2(p)$, $p$ prime, and for the numbers of those conjugacy classes which do or do not consist of self-normalising subgroups. The formulae are used to prove lower bounds $17$, $18$, $6$ and $12$ respectively satisfied by these invariants for all $p>37$. A computer search carried out for a different problem shows that these bounds are attained for over a million primes $p$; we show that if the Bateman--Horn Conjecture is true, they are attained for infinitely many primes. Also, assuming no unproved conjectures, we use a result of Heath-Brown to obtain upper bounds for these invariants, valid for an infinite set of primes $p$.

Explore related subjects

math.GRmath.NT

Keep this discovery

BibTeXRIS

Gareth A. Jones. 2024-11-04. Counting conjugacy classes of subgroups of ${\rm PSL}_2(p)$. https://arxiv.org/abs/2411.02219

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗