On the maximal width of empty lattice simplices
From MaRDI portal
DOI10.1006/EUJC.1999.0325zbMATH Open0966.52013OpenAlexW2045230236MaRDI QIDQ1964652FDOQ1964652
Christian Haase, Günter M. Ziegler
Publication date: 16 August 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/60d6600408bc33f4210631c1fb7b47ef73f5b76f
Recommendations
Cites Work
Cited In (20)
- Hollow polytopes of large width
- Title not available (Why is that?)
- Minimal polygons with fixed lattice width
- Convex normality of rational polytopes with long edges
- On lattice-free orbit polytopes
- Multivariate Abel-Ruffini
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- On integer programming with bounded determinants
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
- A generalization of a theorem of White
- The finiteness threshold width of lattice polytopes
- On empty lattice simplices in dimension 4
- Classification of empty lattice 4-simplices of width larger than 2
- The complete classification of empty lattice 4-simplices
- Elementary moves on lattice polytopes
- Lattice size in higher dimensions
- Classification of empty lattice 4-simplices of width larger than two
- Tropical degenerations and stable rationality
- Enumeration and unimodular equivalence of empty delta-modular simplices
This page was built for publication: On the maximal width of empty lattice simplices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964652)