Triangles capturing many lattice points

DOI10.1112/S0025579318000219MaRDI QIDQ3176211zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Steinerberger, Nicholas F. Marshall

Publication date 19 July 2018

Published in Mathematika (Search for Journal in Brave)

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

zbMATH Keywords

Fourier transformRadon transformpolynomialellipsoidcross-section

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice points in specified regions (11P21) Geometric constructions in real or complex geometry (51M15) Real and complex geometry (51M99)

Abstract: We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $mathbb{Z}_{>0}^2$? Moreover, does its shape necessarily converge to the isosceles triangle $(x=y)$ as the area becomes large? Laugesen and Liu suggested that, in contrast to similar problems, there might not be a limiting shape. We prove that the limiting set is indeed nontrivial and contains infinitely many elements. We also show that there exist `bad' areas where no triangle is particularly good at capturing lattice points and show that there exists an infinite set of slopes $y/x$ such that any associated triangle captures more lattice points than any other fixed triangle for infinitely many (and arbitrarily large) areas; this set of slopes is a fractal subset of $[1/3,3]$ and has Minkowski dimension at most $3/4$.

Recommendations

• Triangles of extremal area or perimeter in a finite planar point set
• The limit shape of convex lattice polygons
• Extremal problems on triangle areas in two and three dimensions
• Longest convex lattice chains
• scientific article; zbMATH DE number 866006

Cites work

• scientific article; zbMATH DE number 3440485 (Why is no real title available?)
• Asymptotic behaviour of optimal spectral planar domains with fixed perimeter
• Computing the Continuous Discretely
• Maximising Neumann eigenvalues on rectangles
• Minimizing Dirichlet eigenvalues on cuboids of unit measure
• Optimal spectral rectangles and lattice ellipses
• Optimal stretching for lattice points and eigenvalues
• Optimal stretching for lattice points under convex curves
• Optimisation of eigenvalues of the Dirichlet Laplacian with a surface area restriction
• The eigenvalues of the Laplacian with Dirichlet boundary condition in \(\mathbb {R}^2\) are almost never minimized by disks

Cited in

(8)

• Many triangles with few edges
• 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\)
• Shifted lattices and asymptotically optimal ellipses
• Asymptotic behaviour of cuboids optimising Laplacian eigenvalues
• Asymptotic shape optimization for Riesz means of the Dirichlet Laplacian over convex domains
• A note on lattice points and optimal stretching

This page was built for publication: Triangles capturing many lattice points

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