Lattice points in stretched finite type domains (Q2079471)

The classical problem of counting lattice points in an integral \(d\)-dimensional lattice \(\mathbb{Z}^d \in \mathbb{R}^d\), bounded by a closed (compact) convex surface \(\Omega\), containing the origin, has a rich history which dates back to Gauss. This present work is concerned with a variation of this lattice point problem, where for \(A = \mathrm{diag}\,(a_1,\dots , a_d)\), a positive definite diagonal matrix with determinant 1, one consider the so-called optimal stretching problem, where a volume-preserving stretch of \(\Omega\) by the stretching matrix factor \(A\) is a domain of the form \[ A\Omega = {(a_1x_1,\dots , a_dx_d) : (x_1,\dots , x_d) \in\Omega}. \] In particular the authors are interested in the limiting behavior of \(A\) (as \(t\) goes to infinity) for those matrices \(A\) such that the number of positive-integer lattice points in the enlarged stretch of \(\Omega\), whereby \(\#(\mathbb{N}^d \cap tA\Omega)\), attains the largest value. Similarly, the question can be asked for matrices \(A\) such that \(\#(\mathbb{Z}_+^d \cap tA\Omega)\) attains the smallest value where \(\mathbb{Z}_+=\{0\}\cup \mathbb{N}\). With the notation that a domain in \(\mathbb{R}^d\) (\(d\geq 2\)) is said to be balanced if the \((d-1)\)-dimensional measures of the intersections of the domain with each coordinate hyperplane are equal. The authors go on to show that for arbitrary convex domains of finite type with smooth boundary, that are symmetric with respect to each coordinate hyperplane/axis, the optimal domains which contain the most positive (or least nonnegative) lattice points must be asymptotically balanced.