On the number of lattice free polytopes
From MaRDI portal
Publication:1964651
DOI10.1006/EUJC.1999.0324zbMath0954.52015OpenAlexW2004414619MaRDI QIDQ1964651
Jean-Michel Kantor, Imre Bárány
Publication date: 14 February 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1999.0324
Related Items (6)
Saturation of Newton polytopes of type A and D cluster variables ⋮ The representation polyhedron of a semiorder. ⋮ The diameter of lattice zonotopes ⋮ Classification of lattice-regular lattice convex polytopes ⋮ On lattice-free orbit polytopes ⋮ Elementary moves on lattice polytopes
Cites Work
- The difference body of a convex body
- A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
- Covering minima and lattice-point-free convex bodies
- Geometric algorithms and combinatorial optimization
- Triangulations of integral polytopes and Ehrhart polynomials
- On the number of convex lattice polytopes
- Convexity in cristallographical lattices
- Integral Polyhedra in Three Space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of lattice free polytopes