SearcharxivSearch

arXiv · math/0406164

Subgroup growth of lattices in semisimple Lie groups

Abstract

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the Generalized Riemann Hypothesis for number fields but we can state the following unconditional theorem: Let $G$ be a simple Lie group of real rank at least 2, different than $D_4(\bbc)$, and let $Γ$ be any non-uniform lattice of $G$. Let $s_n(Γ)$ denote the number of subgroups of index at most $n$ in $Γ$. Then the limit $\lim\limits_{n\to \infty} \frac{\log s_n(Γ)}{(\log n)^2/ \log \log n}$ exists and equals a constant $γ(G)$ which depends only on the Lie type of $G$ and can be easily computed from its root system.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Lubotzky, N. Nikolov. 2004-06-09. Subgroup growth of lattices in semisimple Lie groups. https://arxiv.org/abs/math/0406164

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