Note: Lattice polytopes of degree 2

Authors:
Jaron Treutlein
Affiliations:
Department of Mathematics and Physics, University of Tübingen, Auf der Morgenstelle 10, D-72076 Tübingen, Germany
Venue:
Journal of Combinatorial Theory Series A
Year:
2010

Citing 3
Cited 0

Enumerative combinatorics

Enumerative combinatorics
A monotonicity property of h-vectors and h*-vectors

European Journal of Combinatorics - Special issue dedicated to Bernt Lindstro¨m
Lattice polytopes having h*-polynomials with given degree and linear coefficient

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly i0 interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimensions. In particular, there is only a finite number of quadratic polynomials with fixed leading coefficient being the h^*-polynomial of a lattice polytope.