Recognition: unknown
Few smooth d-polytopes with n lattice points
classification
🧮 math.AG
math.COmath.SG
keywords
latticepointssmoothd-polytopesfinitelyfixedmanyonly
read the original 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. We also enumerate all smooth 3-polytopes with at most 12 lattice points. In fact, it is sufficient to bound the singularities and the number of lattice points on edges to prove finiteness.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.