On the mean square of the remainder for the Euclidean lattice point counting problem

2015/12/18 by Kelmer, Dubi
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1512.06012

Abstract

We give mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in ℝ^d, when averaged over families of shears of the lattice.

Related

• The number of points from a random lattice that lie inside a ball
• Lattice points in a circle for generic unimodular shears
• Moments of the number of points in a bounded set for number field lattices
• Variance of Lattice Point Counting in Thin Annuli
• Counting rational points on the sphere with bounded denominator