On the Asymptotic Number of Generators of High Rank Arithmetic Lattices

preprint2021arXivOpen access

Abstract

Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators d(Γ)d(Γ) of a lattice ΓΓ in a high rank simple Lie group HH grows sub-linearly with v=μ(H/Γ)v = μ(H / Γ), the co-volume of ΓΓ in HH. We prove this for non-uniform lattices in a very strong form, showing that for 2−2-generic such HH's, d(Γ)=OH(log⁡v/log⁡log⁡v)d(Γ) = O_H(\log v / \log \log v), 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(Γ)=O(log⁡v)d(Γ) = O(\log v).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.