Clean Lattice Tetrahedra
| dc.creator | Reznick, Bruce | |
| dc.date | 2006-06-09 | |
| dc.date.accessioned | 2026-07-07T07:17:08Z | |
| dc.date.available | 2026-07-07T07:17:08Z | |
| dc.description | 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. | |
| dc.description | submitted for publication | |
| dc.identifier | https://arxiv.org/abs/math/0606227 | |
| dc.identifier | http://arxiv.org/abs/math/0606227 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/113836 | |
| dc.subject | Combinatorics | |
| dc.subject | Number Theory | |
| dc.subject | 52B20, 11H06 | |
| dc.title | Clean Lattice Tetrahedra | |
| dc.type | text |