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 that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant . Specifically, we prove that the stretched convex domain which captures the most positive lattice points in the large volume limit is balanced: the -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.
Recommendations
- Optimal stretching for lattice points under convex curves
- Optimal spectral rectangles and lattice ellipses
- On the lattice point problem for ellipsoids
- Shifted lattices and asymptotically optimal ellipses
- Diameter and radius in the Manhattan metric
- Lattice points in stretched finite type domains
- Lattice points in elliptic paraboloids
- Asymptotic Formulae for the Lattice Point Enumerator
- scientific article; zbMATH DE number 7293040
- The perimeter of optimal convex lattice polygons in the sense of different metrics
Cited in
(6)- Optimal stretching for lattice points and eigenvalues
- Extremal eigenvalues of the Dirichlet biharmonic operator on rectangles
- Lattice points in stretched finite type domains
- Lattice points in stretched model domains of finite type in \(\mathbb{R}^d\)
- Optimal stretching for lattice points under convex curves
- A note on lattice points and optimal stretching
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)