Few smooth d-polytopes with N lattice points
Authors:
- Tristram BogartTBTristram Bogart
- Christian HaaseCHChristian Haase
- Milena HeringMHMilena Hering
- Benjamin LorenzBLBenjamin Lorenz
- Benjamin NillBNBenjamin Nill
- Andreas PaffenholzAPAndreas Paffenholz
- Francisco SantosFSFrancisco Santos
- Hal SchenckHSHal Schenck
Preprint
Abstract
We prove that, for fixed N there exist only finitely many embeddings of Q-factorial toric varieties X into P^N that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d and N, there are only finitely many smooth d-polytopes with N lattice points. The argument is turned into an algorithm to classify smooth 3-polytopes with \le 12 lattice points.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Convex normality of rational polytopes with long edgesAdvances in Mathematics, 2012
- On the combinatorial classification of toric log del Pezzo surfacesLMS Journal of Computation and Mathematics, 2010
- Classification of toric Fano 5-foldsAdvances in Geometry, 2008
- The Minimum Area of Convex Lattice n -GonsCombinatorica, 2004
- On generators of ideals defining projective toric varietiesmanuscripta mathematica, 2002
- On the classification of toric Fano 4-foldsJournal of Mathematical Sciences, 1999
- Combinatorial Convexity and Algebraic Geometry1996
- Smooth toric varieties with small picard number are projectiveTopology, 1991
- Lattice vertex polytopes with interior lattice pointsPacific Journal of Mathematics, 1983
- Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and PolytopesAnnals of Mathematics, 1972