Stretching Convex Domains to Capture Many Lattice Points

From MaRDI portal
Publication:3296124




Abstract: We consider an optimal stretching problem for strictly convex domains in mathbbRd that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant 1. Specifically, we prove that the stretched convex domain which captures the most positive lattice points in the large volume limit is balanced: the (d1)-dimensional measures of the intersections of the domain with each coordinate hyperplane are equal. Our results extend those of Antunes & Freitas, van den Berg, Bucur & Gittins, Ariturk & Laugesen, van den Berg & Gittins, and Gittins & Larson. The approach is motivated by the Fourier analysis techniques used to prove the classical result for the Gauss circle problem.









This page was built for publication: Stretching Convex Domains to Capture Many Lattice Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296124)