加载中…
We prove an upper bound for the error term in the higher rank hyperbolic lattice counting problem for . Blomer and Lutsko achieved recently a significant improvement of previous known results by Duke–Rudnick–Sarnak and Gorodnik–Nevo–Yehoshua. We deduce an improved upper bound for the error which holds for almost all pairs . We also derive a -result for the error term, in the spirit of Rudnick–Phillips.

生成讲解博客的中文版本

生成AI智能校验的中文版本