Minimal requirements for Minkowski's theorem in the plane I
From MaRDI portal
Publication:3879865
DOI10.1017/S0004972700006560zbMath0438.52002MaRDI QIDQ3879865
Publication date: 1980
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Models of curves over discrete valuation rings, Modifying Minkowski's theorem, Mixed-integer sets from two rows of two adjacent simplex bases, Realizable quadruples for hex-polygons. Combinatorics of honeycombs, A proof of Coleman's conjecture, Moving out the edges of a lattice polygon, Unbounded convex sets for non-convex mixed-integer quadratic programming, An extremal result on convex lattice polygons, On the first unknown value of the function
Cites Work