Grigorchuk–Lubotzky–Pyber conjecture on congruence subgroup growth

From papers

Let GG) be a simple, simply connected, connected algebraic group defined over a number field kk, let SS be a finite set of valuations containing the archimedean ones, and set Γ=G(OS)\Gamma=G(\mathcal{O}_S). For each nonzero ideal II of the ring of SS-integers, let Γ(I)\Gamma(I) be the principal congruence subgroup, and let Cn(Γ)C_n(\Gamma) count congruence subgroups of index at most nn. Define

α+(Γ)=lim supnlogCn(Γ)(logn)2/loglogn,α(Γ)=lim infnlogCn(Γ)(logn)2/loglogn.\alpha_+(\Gamma)=\limsup_{n\to\infty}\frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n},\qquad \alpha_-(\Gamma)=\liminf_{n\to\infty}\frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n}.

Writing R=Φ+/lR=|\Phi_+|/l, where Φ+\Phi_+ is the set of positive roots of the root system of GG and l=rank(G)l=\operatorname{rank}(G), set

γ(G)=(R(R+1)R)24R2.\gamma(G)=\frac{(\sqrt{R(R+1)}-R)^2}{4R^2}.

Grigorchuk–Lubotzky–Pyber conjecture. The two asymptotic constants coincide and equal

α+(Γ)=α(Γ)=γ(G).\alpha_+(\Gamma)=\alpha_-(\Gamma)=\gamma(G).

The lower bound was previously known under the Generalized Riemann Hypothesis for Artin LL-functions, and unconditionally in certain arithmetic cases. The paper proves the upper bound in general and extends the lower-bound results, so the conjecture is proved modulo GRH in the stated generality and unconditionally in specified cases.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

A. Lubotzky and N. Nikolov, “Subgroup growth of lattices in semisimple Lie groups”, arXiv:math/0406164 (2004).

Solutions 0

No solutions have been posted yet.