Lattice polytopes having h^*-polynomials with given degree and linear coefficient

Details Lattice polytopes having h^*-polynomials with given degree and linear coefficient Lattice polytopes having h^*-polynomials with given degree and linear coefficient

2007-05-08

arxiv.org/abs/0705.1082v2

Eur. J. Comb. 29 (2008), 1596-1602

Mathematics

Combinatorics

AMS-LaTeX, 9 pages; introduction improved

Scientific paper

10.1016/j.ejc.2007.11.002

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a lattice pyramid over a lower-dimensional lattice polytope, if the dimension of P is greater or equal to h^*_1 (2d+1) + 4d-1. This result has a purely combinatorial proof and generalizes a recent theorem of Batyrev.

Affiliated with

Also associated with

No associations

Rating

Lattice polytopes having h^*-polynomials with given degree and linear coefficient does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lattice polytopes having h^*-polynomials with given degree and linear coefficient, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattice polytopes having h^*-polynomials with given degree and linear coefficient will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153627