Counting arithmetic lattices and surfaces (Q624932)

The authors are interested in the asymptotic behavior of the following function: let \(H\) be a simple Lie group and \(x\) be a positive number. The authors study the function \(AL_H(x)=\) number of conjugacy classes of arithmetic lattices of \(H\) of covolume at most \(x\). The subject is not new. After a brief explanation of the novelty of their work, the authors show among other things the following theorems. Theorem 1.1 states that if \(H\) is of real rank one then there exists a positive constant \(b=b(H)>0\) such that \(AL_H(x) \leqslant x^{bx}\) for \(x \gg 0\). Theorem 1.2 states that if \(H=\text{PSO}_{n,1}(\mathbb{R})\) then there exists a positive constant \(a=a(H)>0\) such that \(AL_H(x) \geqslant x^{bx}\) for \(x \gg 0\). In the case of \(H=\text{PSL}_{2}(\mathbb{R})\) the authors even find a very precise estimation, namely they show that \(AL_H(x)\) is equivalent to \(\frac{1}{2 \pi} x \log(x)\). Roughly speaking, they prove Theorem 1.1 by showing that the number of conjugacy classes of MAXIMAL lattices in \(\text{PSL}_{2}(\mathbb{R})\) and \(\text{PSL}_{2}(\mathbb{C})\) of covolume at most \(x\) grows ``slowly'', which reduces the problem to the subgroup growth of such a given maximal lattice. They get this last estimate with Theorem 1.5 by showing that in a real rank one simple Lie group the minimal number of generators of a lattice is controlled by the covolume.