Clean Lattice Tetrahedra
arXiv:math/0606227
Abstract
A clean lattice tetrahedron is a non-degenerate tetrahedron with the property that the only lattice points on its boundary are its vertices. We present some new proofs of old results and some new results on clean lattice tetrahedra, with an emphasis on counting the number of its interior lattice points and on computing its lattice width.
submitted for publication
Cited by in corpus (7)
- Lattice 3-polytopes with six lattice points
- Lattice 3-polytopes with few lattice points
- Unimodular triangulations of dilated 3-polytopes
- Classifying terminal weighted projective space
- Classification of triples of lattice polytopes with a given mixed volume
- 3-Dimensional Lattice Polytopes Without Interior Lattice Points
- Invariants for critical dimension groups and permutation-Hermite equivalence