English

Lattice polytopes with a given $h^*$-polynomial

Combinatorics 2007-05-23 v2 Commutative Algebra Algebraic Geometry

Abstract

Let ΔRn\Delta \subset \R^n be an nn-dimensional lattice polytope. It is well-known that hΔ(t):=(1t)n+1k0kΔZntkh_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k is a polynomial of degree dnd \leq n with nonnegative integral coefficients. Let AGL(n,Z)AGL(n, \Z) be the group of invertible affine integral transformations which naturally acts on Rn\R^n. For a given polynomial hZ[t]h^* \in \Z[t], we denote by Ch(n)C_{h^*}(n) the number AGL(n,Z)AGL(n, \Z)-equivalence classes of nn-dimensional lattice polytopes such that h=hΔ(t)h^* = h_{\Delta}^*(t). In this paper we show that {Ch(n)}n1\{C_{h^*}(n) \}_{n \geq 1} is a monotone increasing sequence which eventually becomes constant. This statement follows from a more general combinatorial result whose proof uses methods of commutative algebra.

Keywords

Cite

@article{arxiv.math/0602593,
  title  = {Lattice polytopes with a given $h^*$-polynomial},
  author = {Victor Batyrev},
  journal= {arXiv preprint arXiv:math/0602593},
  year   = {2007}
}

Comments

10 pages. AMS-LaTeX, some typos were corrected