A generalization of the discrete version of Minkowski's fundamental theorem

DOI10.1112/S002557931500042XMaRDI QIDQ2827908zbMATH OpenOpenAlexFDO

Authors Matthias Henze, Bernardo González Merino

Publication date 21 October 2016

Published in Mathematika (Search for Journal in Brave)

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

zbMATH Keywords

volumeMinkowski's fundamental theorem0-symmetric convex body

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies (number-theoretic aspects) (11H06) Inverse problems of additive number theory, including sumsets (11P70)

Abstract: One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice point is the origin. Minkowski also obtained a discrete analog by proving optimal upper bounds on the number of lattice points in the boundary of such convex bodies. Whereas the volume inequality has been generalized to any number of interior lattice points already by van der Corput in the 1930s, a corresponding result for the discrete case remained to be proven. Our main contribution is a corresponding optimal relation between the number of boundary and interior lattice points of an o-symmetric convex body. The proof relies on a congruence argument and a difference set estimate from additive combinatorics.

Recommendations

• A discrete analogue for Minkowski's second theorem on successive minima
• Variations of Minkowski's theorem on successive minima
• An optimization problem related to Minkowski's successive minima
• On the boundary of an extremal body
• Bounds on the lattice point enumerator via slices and projections

Cites work

• A discrete analogue for Minkowski's second theorem on successive minima
• An upper bound for \(d\)-dimensional difference sets
• Convexity in cristallographical lattices
• Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
• Lattice points in lattice polytopes
• Lattice-width directions and Minkowski's \(3^d\)-theorem
• On convex lattice polygons
• On finite difference sets
• On maximal \(S\)-free sets and the Helly number for the family of \(S\)-convex sets
• Successive-minima-type inequalities

Cited in

(8)

• Equality case in Van der Corput's inequality and collisions in multiple lattice tilings
• Bounds on the lattice point enumerator via slices and projections
• Triangulations and a discrete Brunn-Minkowski inequality in the plane
• Minkowski's successive minima in convex and discrete geometry
• Lattice point inequalities for centered convex bodies
• On discreteness of commensurators
• Tight bounds on discrete quantitative Helly numbers
• Difference sets in higher dimensions

This page was built for publication: A generalization of the discrete version of Minkowski's fundamental theorem

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