Counting non-uniform lattices

Mikhail Belolipetsky, Alexander Lubotzky*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In [BGLM] and [GLNP] it was conjectured that if H is a simple Lie group of real rank at least 2, then the number of conjugacy classes of (arithmetic) lattices in H of covolume at most x is x(γ(H)+o(1)) log x/ log log x where γ(H) is an explicit constant computable from the (absolute) root system of H. In [BLu] we disproved this conjecture. In this paper we prove that for most groups H the conjecture is actually true if we restrict to counting only non-uniform lattices.

Original languageEnglish
Pages (from-to)201-229
Number of pages29
JournalIsrael Journal of Mathematics
Volume232
Issue number1
DOIs
StatePublished - 1 Aug 2019

Bibliographical note

Publisher Copyright:
© 2019, The Hebrew University of Jerusalem.

Fingerprint

Dive into the research topics of 'Counting non-uniform lattices'. Together they form a unique fingerprint.

Cite this