Lattice Point Inequalities for Centered Convex Bodies
From MaRDI portal
Publication:2808167
DOI10.1137/15M1031369zbMath1343.11063arXiv1505.06444MaRDI QIDQ2808167
Martin Henk, Sören Lennart Berg
Publication date: 26 May 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.06444
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice points in specified regions (11P21)
Related Items
Improved bounds for Hadwiger's covering problem via thin-shell estimates, The polar of convex lattice sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variations of Minkowski's theorem on successive minima
- On the equality case in Ehrhart's volume conjecture
- The harmonic mean measure of symmetry for convex bodies
- The volume of Kähler-Einstein Fano varieties and convex bodies
- Asymmetry of a plane convex set with respect to its centroid
- Partitions of mass-distributions and of convex bodies by hyperplanes
- On lattice polytopes having interior lattice points
- Lattice vertex polytopes with interior lattice points
- Unsolved problems in geometry
- Successive-minima-type inequalities
- Entropy and asymptotic geometry of non-symmetric convex bodies
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
- A GENERALIZATION OF THE DISCRETE VERSION OF MINKOWSKI'S FUNDAMENTAL THEOREM
- A discrete analogue for Minkowski’s second theorem on successive minima
- On the Size of Lattice Simplices with a Single Interior Lattice Point
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- On convex lattice polygons
- Volume réticulaire critique d'un simplexe.
- Lattice points in lattice polytopes
- Lattice-Width Directions and Minkowski's $3^d$-Theorem
- Computing the Continuous Discretely
- Convex and Discrete Geometry
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.