Search arXivSearch

arXiv · math/0406163

Counting primes, groups and manifolds

Abstract

Let $Λ= \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(Λ)$ be the number of congruence subgroups of $Λ$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(Λ)}{(\log n)^2/\log\log n} = \frac{3-2\sqrt{2}}{4}.$ The proof is based on the Bombieri-Vinogradov `Riemann hypothesis on the average' and on the solution of a new type of extremal problem in combinatorial number theory. Similar surprisingly sharp estimates are obtained for the subgroup growth of lattices in higher rank semisimple Lie groups. If $G$ is such a Lie group and $Γ$ is an irreducible lattice of $G$ it turns out that the subgroup growth of $Γ$ is independent of the lattice and depends only on the Lie type of the direct factors of $G$. It can be calculated easily from the root system. The most general case of this result relies on the Generalized Riemann Hypothesis but many special cases are unconditional. The proofs use techniques from number theory, algebraic groups, finite group theory and combinatorics.

Explore related subjects

Keep this discovery

BibTeXRIS

D. Goldfeld, A. Lubotzky, N. Nikolov, L. Pyber. 2004-06-09. Counting primes, groups and manifolds. https://doi.org/10.1073/pnas.0404571101

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