Ehrhart Series, Unimodality, and Integrally Closed Reflexive Polytopes
نویسندگان
چکیده
منابع مشابه
An Ehrhart Series Formula For Reflexive Polytopes
It is well known that for P and Q lattice polytopes, the Ehrhart polynomial of P×Q satisfies LP×Q(t) = LP (t)LQ(t). We show that there is a similar multiplicative relationship between the Ehrhart series for P , for Q, and for the free sum P ⊕ Q that holds when P is reflexive and Q contains 0 in its interior. Let P be a lattice polytope of dimension d, i.e. a convex polytope in R whose vertices ...
متن کاملAn Upper Bound Theorem concerning lattice polytopes
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
متن کاملEhrhart Series of Polytopes Related to Symmetric Doubly-Stochastic Matrices
In Ehrhart theory, the h∗-vector of a rational polytope often provides insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic matrices, has a unimodal h∗-vector, but when even small modifications are made to the polytope, the same property can be very difficult to prove. In this paper, w...
متن کاملEhrhart polynomials of cyclic polytopes
Abstract. The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In [1], the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial of it is equal to its volume plus the Ehrhart polynomial of its lower envelope and proved the case when the dimension d = 2. In our article, we prove the conje...
متن کاملEhrhart Polynomials of Matroid Polytopes and Polymatroids
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials. In the second half we discuss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2016
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-016-0337-6