Pointwise improvement of the error term in the higher rank hyperbolic lattice counting problem

arXiv:2610.16668 · math.NT · Submitted 2026-10-12 · Read on arXiv

math.NT

Submitted: 2026-10-12

Updated: 2026-10-25

Comments: 25 pages, 1 figure

License: http://creativecommons.org/licenses/by/4.0/

The gist: We prove an upper bound for the error term in the higher rank hyperbolic lattice counting problem for (n, Z).

Terminology

Abstract

We prove an upper bound for the error term in the higher rank hyperbolic lattice counting problem for (n, Z). 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 z,w in (n, R). We also derive a Ω-result for the error term, in the spirit of Phillips--Rudnick.

Sources

Related papers