Clean Lattice Tetrahedra
Combinatorics
2007-05-23 v1 Number Theory
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.
Cite
@article{arxiv.math/0606227,
title = {Clean Lattice Tetrahedra},
author = {Bruce Reznick},
journal= {arXiv preprint arXiv:math/0606227},
year = {2007}
}
Comments
submitted for publication