Counting non-uniform lattices
Group Theory
2018-04-03 v2 Number Theory
Abstract
In [BGLM] and [GLNP] it was conjectured that if is a simple Lie group of real rank at least 2, then the number of conjugacy classes of (arithmetic) lattices in of covolume at most is where is an explicit constant computable from the (absolute) root system of . In [BLu] we disproved this conjecture. In this paper we prove that for most groups the conjecture is actually true if we restrict to counting only non-uniform lattices.
Cite
@article{arxiv.1706.02180,
title = {Counting non-uniform lattices},
author = {Mikhail Belolipetsky and Alex Lubotzky},
journal= {arXiv preprint arXiv:1706.02180},
year = {2018}
}
Comments
23 pages, revised following referee's comments. Dedicated to Aner Shalev on his 60th birthday. This paper is related to our previous work arXiv:0905.1841 with which it shares some preliminaries