Minimal polygons with fixed lattice width (Q2003728): Difference between revisions

A lattice polygon \(\Delta\) is a convex hull of finitely many points from \(\mathbb{Z}^2\) that has non-empty interior. The lattice width of \(\Delta\) in direction \(v \in \mathbb{Z}^2 \setminus \{(0,0)\}\) is \(\mathrm{lw}_v(\Delta)=\max_{p,q \in \Delta} \langle p-q,v\rangle\), the lattice width of \(\Delta\) is \(\mathrm{lw}(\Delta)=\min_v \mathrm{lw}_v(\Delta)\). The polygon \(\Delta\) is minimal if \(\mathrm{lw}(\Delta')< \mathrm{lw}(\Delta)\) for every lattice polygon \(\Delta' \subseteq \Delta\) with \(\Delta' \ne \Delta\). The authors characterize all minimal lattice polygons \(\Delta\) with prescribed width \(\mathrm{lw}(\Delta)=d\), \(d=1,2,3,\ldots\), up to unimodular equivalence. As a corollary, they obtain a sharp upper bound on the number of lattice points contained in these polygons.