Discrete analogues of John's theorem
From MaRDI portal
Publication:2332797
DOI10.2140/moscow.2019.8.367zbMath1447.11073arXiv1904.05280OpenAlexW3102350663WikidataQ127091091 ScholiaQ127091091MaRDI QIDQ2332797
Martin Henk, Sören Lennart Berg
Publication date: 5 November 2019
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.05280
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
- Unnamed Item
- Unique determination of convex lattice sets
- Some inequalities related to the Seysen measure of a lattice
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- John-type theorems for generalized arithmetic progressions and iterated sumsets
- An optimization problem related to Minkowski's successive minima
- Simultaneously good bases of a lattice and its reciprocal lattice
- Successive-minima-type inequalities
- Simultaneous reduction of a lattice basis and its reciprocal basis
- A discrete version of Koldobsky's slicing inequality
- A discrete analogue for Minkowski’s second theorem on successive minima
- On a Discrete Brunn--Minkowski Type Inequality
- An Introduction to the Geometry of Numbers
- Asymptotic Geometric Analysis, Part I
- Convex Bodies The Brunn-MinkowskiTheory
