Stretching Convex Domains to Capture Many Lattice Points

DOI10.1093/IMRN/RNY102zbMATH Open1448.52012arXiv1707.00682OpenAlexW2964293880MaRDI QIDQ3296124FDOQ3296124

Nicholas F. Marshall

Publication date: 7 July 2020

Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: We consider an optimal stretching problem for strictly convex domains in $mathbb{R}^d$ 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 $(d-1)$-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.

Full work available at URL: https://arxiv.org/abs/1707.00682

zbMATH Keywords

lattice pointsGauss circle problem

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice points in specified regions (11P21)

Cited In (4)

• Lattice points in stretched finite type domains
• Extremal eigenvalues of the Dirichlet biharmonic operator on rectangles
• Lattice points in stretched model domains of finite type in \(\mathbb{R}^d\)
• Optimal stretching for lattice points and eigenvalues

Recommendations

• Title not available (Why is that?) 👍 👎
• Optimal spectral rectangles and lattice ellipses 👍 👎
• The perimeter of optimal convex lattice polygons in the sense of different metrics 👍 👎
• Diameter and radius in the Manhattan metric 👍 👎
• On the lattice point problem for ellipsoids 👍 👎
• Asymptotic Formulae for the Lattice Point Enumerator 👍 👎
• Shifted lattices and asymptotically optimal ellipses 👍 👎
• Optimal stretching for lattice points under convex curves 👍 👎
• Lattice points in elliptic paraboloids 👍 👎
• Lattice points in stretched finite type domains 👍 👎

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)