Indexed metadata

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

Dimitrios Chatzakos, Panagiotis Dimakis, Christos Katsivelos

Source record

Source: arXiv

Published: Oct 12, 2026

arXiv: 2610.16668

Open original source ↗

Source abstract

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

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.