Related papers: Bounds on Area Involving Lattice Size

The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…

Toric log del Pezzo surfaces correspond to convex lattice polygons containing the origin in their interior and having only primitive vertices. An upper bound on the volume and on the number of boundary lattice points of these polygons is…

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

In 2021, Ordentlich, Regev and Weiss made a breakthrough that the lattice covering density of any $n$-dimensional convex body is upper bounded by $cn^{2}$, improving on the best previous bound established by Rogers in 1959. However, for the…

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…

In this note, we study Seshadri constants and Gromov widths of toric surfaces via lattice widths of their moment polygons. We give the sharp lower bound of the ratio between the Gromov width of a symplectic toric $4$-fold and the lattice…

Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…

We prove that any finite dimensional Alexandrov space with a lower curvature bound is locally Lipschitz contractible. As applications, we obtain a sufficient condition for solving the Plateau problem in an Alexandrov space considered by…

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

In \cite{rigidity}, Luo introduced a $\psi_{\lambda}$ edge invariant which turns out to be a coordinate of the Teichm\"uller space of a surface with boundary. And he proved that for $\lambda \geq 0$, the image of the Teichm\"uller space…

The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has…

We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…