Lattice points in a circle for generic unimodular shears
Dubi Kelmer

TL;DR
This paper provides an elementary proof that the average squared error in counting lattice points within a circle for all sheared unimodular lattices grows at most proportionally to T log^2(T).
Contribution
It introduces a simple proof showing the mean square of the lattice point remainder is bounded for all shears of a unimodular lattice.
Findings
Mean square of the remainder is bounded by O(T log^2(T))
Elementary proof technique used for the bound
Applicable to all shears of a unimodular lattice
Abstract
Given a unimodular lattice consider the counting function counting the number of lattice points of norm less than , and the remainder . We give an elementary proof that the mean square of the remainder over the set of all shears of a unimodular lattice is bounded by .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
