Lattice polytopes having h^*-polynomials with given degree and linear coefficient
| dc.creator | Nill, Benjamin | |
| dc.date | 2007-05-08 | |
| dc.date | 2007-11-29 | |
| dc.date.accessioned | 2026-07-07T10:05:32Z | |
| dc.date.available | 2026-07-07T10:05:32Z | |
| dc.description | 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. | |
| dc.description | AMS-LaTeX, 9 pages; introduction improved | |
| dc.identifier | https://arxiv.org/abs/0705.1082 | |
| dc.identifier | http://arxiv.org/abs/0705.1082 | |
| dc.identifier | Eur. J. Comb. 29 (2008), 1596-1602 | |
| dc.identifier | doi:10.1016/j.ejc.2007.11.002 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170036 | |
| dc.subject | Combinatorics | |
| dc.subject | 52B20 | |
| dc.title | Lattice polytopes having h^*-polynomials with given degree and linear coefficient | |
| dc.type | text |