Counting non-uniform lattices

被引:0
|
作者
Mikhail Belolipetsky
Alexander Lubotzky
机构
[1] Instituto Nacional de Matemática Pura e Aplicada,Institute of Mathematics
[2] The Hebrew University of Jerusalem,undefined
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:201 / 229
页数:28
相关论文
共 50 条