On integer points in polyhedra: A lower bound
From MaRDI portal
Publication:1196682
DOI10.1007/BF01204716zbMath0754.52005MaRDI QIDQ1196682
László Lovász, Roger E. Howe, Imre Bárány
Publication date: 16 January 1993
Published in: Combinatorica (Search for Journal in Brave)
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items
On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid, Enumerating Integer Points in Polytopes with Bounded Subdeterminants, On the number of irreducible points in polyhedra, About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces, Random points and lattice points in convex bodies, On the polyhedral complexity of the integer points in a hyperball, Some theoretical challenges in digital geometry: a perspective, Note on the complexity of the mixed-integer hull of a polyhedron, Approximation of convex sets by polytopes
Cites Work
