On the Asymptotic Number of Generators of High Rank Arithmetic Lattices

DOI10.1307/MMJ/20217204arXiv2101.07227MaRDI QIDQ6358535FDOQ6358535

Authors: Alexander Lubotzky, Raz Slutsky 

Publication date: 18 January 2021

Abstract: ${\displaystyle }$Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(Gamma)$ of a lattice $Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v=mu(H/Gamma)$, the co-volume of $Gamma$ in $H$. We prove this for non-uniform lattices in a very strong form, showing that for $2-$generic such $H$'s, $d(Gamma)=O_H(logv/loglogv)$, which is essentially optimal. While we can not prove a new upper bound for uniform lattices, we will show that for such lattices one can not expect to achieve a better bound than $d(Gamma)=O(logv)$.

Mathematics Subject Classification ID

Discrete subgroups of Lie groups (22E40) Linear algebraic groups over global fields and their integers (20G30)

This page was built for publication: On the Asymptotic Number of Generators of High Rank Arithmetic Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358535)