arXiv (All)
open access
Pointwise improvement of the error term in the higher rank hyperbolic lattice counting problem
We prove an upper bound for the error term in the higher rank hyperbolic lattice counting problem for ${\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 upp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Omega bound for the Piltz divisor problem#1118893
- Theta Series with Half-integral Characteristics#1202742
- The Jensen--Pólya program and inequalities for arithmetic sequences#1149452
- Optimal dimension-dependent $\ell^p$ and $\ell^{1,\infty}$ estimates of the second-order discrete Riesz transforms#996592
- The discrete second moment of the Riemann zeta-function along powers of Gram points#1357762
Record · ID 1341557
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive