Exact Flatness Constant for One-Point Convex Bodies and the Discrete Isominwidth Problem: The Planar Case

A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it is related to the classical flatness constant as well as a conjectural dual version of Minkowski's convex body theorem due to Makai. Moreover, it is shown that Flt(2, 1) = 3, i.e., any planar convex body with at most one interior point has lattice width at most three. This leads to an isominwidth inequality for the lattice point enumerator of planar convex bodies.