Pointwise improvement of the error term in the higher rank hyperbolic lattice counting problem
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
- On the spectral aspect density hypothesis and application
- The hyperbolic circle problem over Heegner points
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b