A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
From MaRDI portal
Publication:5729375
DOI10.2307/1993769zbMath0118.28301OpenAlexW4255781431MaRDI QIDQ5729375
Publication date: 1963
Full work available at URL: https://doi.org/10.2307/1993769
Related Items
Integer points on hypersurfaces, Embedding stacked polytopes on a polynomial-size grid, Tight bounds on discrete quantitative Helly numbers, Integral points on convex curves, Best and random approximation of a convex body by a polytope, On the complexity of the family of convex sets in \(\mathbb{R}^d\), The number of different digital \(N\)-discs, On a question of V.~I.~Arnol'd, On the Number of Convex Lattice Polygons, The limit shape of convex lattice polygons and related topics, An output sensitive algorithm for discrete convex hulls, On the combinatorial complexity of approximating polytopes, Primitive point packing, Modular hyperbolas, Algorithms for pixelwise shape deformations preserving digital convexity, The diameter of lattice zonotopes, Minimum-perimeter intersecting polygons, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases., Lattice points close to the Heisenberg spheres, Random points and lattice points in convex bodies, Efficiently testing digital convexity and recognizing digital convex polygons, The Number of Gröbner Bases in Finite Fields (Research), On the convex hull of solutions to polynomial congruences, Upper bounds on the maximal number of facets of 0/1-polytopes, On finding a large number of 3D points with a small diameter, On maximal convex lattice polygons inscribed in a plane convex set, Convex bodies, economic cap coverings, random polytopes, Mean lattice point discrepancy bounds. II: Convex domains in the plane, Restriction of toral eigenfunctions to hypersurfaces and nodal sets, Constructing metrics on a 2-torus with a partially prescribed stable norm, An improved construction of progression-free sets, Lattice points on convex curves, Approximating a planar convex set using a sparse grid, Cutting corners, Geometric properties of points on modular hyperbolas, A Theorem Concerning the Integer Lattice, Approximation of convex sets by polytopes, Efficient Algorithms to Test Digital Convexity, The layer number of \(\alpha \)-evenly distributed point sets, The Convex Hull of the Prime Number Graph, Integer points on curves and surfaces
Cites Work
