Lattice-width directions and Minkowski's 3d-theorem

DOI10.1137/120877635zbMATH Open1346.11040arXiv0901.1375OpenAlexW1970330685MaRDI QIDQ4899048FDOQ4899048

Authors: Jan Draisma, Tyrrell B. McAllister, Benjamin Nill 

Publication date: 4 January 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: We show that the number of lattice directions in which a d-dimensional convex body in R^d has minimum width is at most 3^d-1, with equality only for the regular cross-polytope. This is deduced from a sharpened version of the 3^d-theorem due to Hermann Minkowski (22 June 1864--12 January 1909), for which we provide two independent proofs.

Full work available at URL: https://arxiv.org/abs/0901.1375

Recommendations

• A local maximizer for lattice width of 3-dimensional hollow bodies
• scientific article; zbMATH DE number 1054789
• Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies
• Minimal polygons with fixed lattice width
• scientific article; zbMATH DE number 739008

zbMATH Keywords

lattice widthconvex bodygeometry of numbers

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06)

Cited In (7)

• A generalization of the discrete version of Minkowski's fundamental theorem
• Equality case in Van der Corput's inequality and collisions in multiple lattice tilings
• Lattice polygons and families of curves on rational surfaces
• Minimal polygons with fixed lattice width
• Complexity of linear relaxations in integer programming
• A local maximizer for lattice width of 3-dimensional hollow bodies
• Lattice point inequalities for centered convex bodies

This page was built for publication: Lattice-width directions and Minkowski's \(3^d\)-theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899048)