On the maximal width of empty lattice simplices
A \(k\)-dimensional lattice simplex \(S\subset\mathbb{R}^d\) is the convex hull of \(k+1\) affinely independent points from \(\mathbb{Z}^d\), and \(S\) is said to be empty if it intersects \(\mathbb{Z}^d\) only at its vertices. Unexpectedly, the authors construct infinitely many empty lattice \(d\)-simplices of arbitrarily large volume from \((d-1)\)-dimensional ones of the same lattice width, yielding in particular also an infinite sequence of empty lattice 4-simplices of width 2. Modifying a former conjecture they formulate the following finiteness conjecture: For every \(d\geq 2\), there are only finitely many equivalence classes of empty \(d\)-simplices whose width is larger than the greatest width that can be achieved by almost empty simplices in dimension \(d-1\). (A lattice simplex without interior lattice points and with at least one empty facet is called almost empty).
- Covering minima and lattice-point-free convex bodies
- scientific article; zbMATH DE number 1342145 (Why is no real title available?)
- Integral Polyhedra in Three Space
- Lattice Tetrahedra
- On the Volume of Lattice Polyhedra
- On the width of lattice-free simplices
- Terminal Quotient Singularities in Dimensions Three and Four
- Classification of empty lattice 4-simplices of width larger than 2
- Minimal polygons with fixed lattice width
- A generalization of a theorem of White
- Tropical degenerations and stable rationality
- On lattice-free orbit polytopes
- Lattice simplices of maximal dimension with a given degree
- Elementary moves on lattice polytopes
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- scientific article; zbMATH DE number 2186838 (Why is no real title available?)
- Multivariate Abel-Ruffini
- On empty lattice simplices in dimension 4
- On integer programming with bounded determinants
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- The finiteness threshold width of lattice polytopes
- Convex normality of rational polytopes with long edges
- scientific article; zbMATH DE number 1342145 (Why is no real title available?)
- On the width of lattice-free simplices
- Classification of empty lattice 4-simplices of width larger than two
- Hollow polytopes of large width
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
- Lattice size in higher dimensions
- Enumeration and unimodular equivalence of empty delta-modular simplices
- Empty simplices of large width
- Lattice Delone simplices with super-exponential volume
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)
