Benjamin Lorenz
Published 2010-01-04Version 1
After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth lattice polytopes in fixed dimension with an upper bound on the number of lattice points. Additionally I have implemented this algorithm for dimension two and three and used it, together with a classification of smooth minimal fans by Tadao Oda, to create lists of all smooth 2-polytopes and 3-polytopes with at most 12 lattice points.
Comments: 25 pages plus 2 pages containing the polytopes and 16 pages of polymake extension and data files
Classification of terminal simplicial reflexive d-polytopes with 3d-1 vertices
Classification of pseudo-symmetric simplicial reflexive polytopes
Classification of subspaces in ${\mathbb{F}}^2\otimes {\mathbb{F}}^3$ and orbits in ${\mathbb{F}}^2\otimes {\mathbb{F}}^3\otimes {\mathbb{F}}^r$
![QR code for arXiv:1001.0514 [math.CO]](http://oss.arxitics.com/images/favicon.svg)