Finitely many smooth d-polytopes with n lattice points

@article{Bogart2015FinitelyMS,
  title={Finitely many smooth d-polytopes with n lattice points},
  author={Tristram Bogart and Christian Haase and Milena Hering and Benjamin Lorenz and Benjamin Nill and Andreas Paffenholz and G{\"u}nter Rote and Francisco Santos and Hal Schenck},
  journal={Israel Journal of Mathematics},
  year={2015},
  volume={207},
  pages={301-329}
}
We prove that for fixed n there are only finitely many embeddings of ℚ-factorial toric varieties X into ℙn that are induced by a complete linear system. The proof is based on a combinatorial result that implies that for fixed nonnegative integers d and n, there are only finitely many smooth d-polytopes with n lattice points. We also enumerate all smooth 3-polytopes with ≤ 12 lattice points. 
View on Springer
arxiv.org
12 Citations
Highly Influential Citations
2
Background Citations
3
Methods Citations
1
Results Citations
1

12 Citations

Citation Type

Citation Type

Classification of Triples of Lattice Polytopes with a Given Mixed Volume
TLDR
An algorithm is presented that enumerates all irreducible triples of normalized mixed volume up to 4 that are inclusion-maximal and leads to a description of all generic trivariate sparse polynomial systems that are solvable by radicals.
LatticePolytopes: A package for computations with lattice polytopes in Macaulay2
This thesis consists of six papers in algebraic geometry –all of which have close connections to combinatorics. In Paper A we consider complete smooth toric embeddings X ↪ P^N such that for a fixed…
Non-normal Very Ample Polytopes and their Holes
TLDR
There exists a non-normal very ample integral convex polytope of dimension d which has exactly $h$ holes for given integers h and d.
Enumeration of Lattice Polytopes by Their Volume
TLDR
An algorithm is described for the complete enumeration of such equivalence classes of d -dimensional lattice polytopes having volume at most K, for fixed constants d and K, and another proof of the finiteness result is given.
Elementary moves on lattice polytopes
Higher order selfdual toric varieties
The notion of higher order dual varieties of a projective variety, introduced in Piene [Singularities, part 2, (Arcata, Calif., 1981), Proceedings of Symposia in Pure Mathematics, American…
Very ample and Koszul segmental fibrations
In the hierarchy of structural sophistication for lattice polytopes, normal polytopes mark a point of origin; very ample and Koszul polytopes occupy bottom and top spots in this hierarchy,…
Primitive point packing
A point in the $d$-dimensional integer lattice $\mathbb{Z}^d$ is primitive when its coordinates are relatively prime. Two primitive points are multiples of one another when they are opposite, and for…
The Compact Landscape
The landscape of compact Calabi–Yau manifolds, from the torus as an elliptic curve to the quintic manifold. Emphasis is on how software such as Macaulay2 computes desired topological quantities.…
Product-Mix Auctions and Tropical Geometry
TLDR
A new proof of the Unimodularity Theorem is given via the classical unimodularity theorem in integer programming and generalizations of the theorem in higher dimensions are equivalent to various forms of the Oda conjecture in algebraic geometry.
...
...

References

SHOWING 1-10 OF 68 REFERENCES
Generating Smooth Lattice Polytopes
TLDR
An algorithm to compute a representative in each lattice equivalence class of smooth lattice polytopes in dimension d with at most N lattice points is described and results in dimension 2 and 3 are reported.
A classification of smooth convex 3-polytopes with at most 16 lattice points
We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of…
Convex normality of rational polytopes with long edges
Normal polytopes, triangulations, and Koszul algebras.
This paper is devoted to the algebraic and combinatorial properties of polytopal semigroup rings defined äs follows. Let P be a lattice polytope in IR, i.e. a polytope whose vertices have integral…
TOROIDAL FANO VARIETIES AND ROOT SYSTEMS
In this paper it is shown that over an algebraically closed field there exist only finitely many mutually nonisomorphic toroidal Fano varieties. We give a complete description of toroidal Fano…
Lattice points in lattice polytopes
It is shown that, for any lattice polytope P ⊂ℝ d the set int ( P )∩lℤ d (provided that it is non-empty) contains a point whose coefficient of asymmetry with respect to P is at most 8 d · (8 l +7) 2…
An algorithm for the classification of smooth Fano polytopes
We present an algorithm that produces the classification list of smooth Fano d-polytopes for any given d ≥ 1. The input of the algorithm is a single number, namely the positive integer d. The…
Complete classification of reflexive polyhedra in four dimensions
Four dimensional reflexive polyhedra encode the data for smooth Calabi-Yau threefolds that are hypersurfaces in toric varieties, and have important applications both in perturbative and in…
Complete toric varieties with reductive automorphism group
We give equivalent and sufficient criteria for the automorphism group of a complete toric variety, respectively a Gorenstein toric Fano variety, to be reductive. In particular we show that the…
Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
Abstract A lattice polytope is a polytope in whose vertices are all in . The volume of a lattice polytope P containing exactly k ≥ 1 points in d in its interior is bounded above by . Any lattice…
...
...