The height of minimal Hilbert bases
From MaRDI portal
Publication:1378894
DOI10.1007/BF03322141zbMath0964.52015MaRDI QIDQ1378894
Martin Henk, Robert Weismantel
Publication date: 22 July 2001
Published in: Results in Mathematics (Search for Journal in Brave)
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattice points in specified regions (11P21)
Related Items
Simplicial dollar game, On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases, Very ample but not normal lattice polytopes, Non-standard approaches to integer programming, Recognizing conic TDI systems is hard, On computing Hilbert bases via the Elliot--MacMahon algorithm, Existence of unimodular triangulations — positive results
Cites Work
- On the height of the minimal Hilbert basis
- On the ampleness of invertible sheaves in complete projective toric varieties
- A Variant of the Buchberger Algorithm for Integer Programming
- Sensitivity theorems in integer linear programming
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
