arXiv Analytics

Sign in

arXiv:0710.4346 [math.CO]AbstractReferencesReviewsResources

Ehrhart polynomials of matroid polytopes and polymatroids

Jesús A. De Loera, David C. Haws, Matthias Köppe

Published 2007-10-23Version 1

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 two conjectures about the h^*-vector and the coefficients of Ehrhart polynomials of matroid polytopes; we provide theoretical and computational evidence for their validity.

Comments: 28 pages, 6 figures, submitted to Discrete and Computational Geometry
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1711.09962 [math.CO] (Published 2017-11-27)
On positivity of Ehrhart polynomials
arXiv:1804.00208 [math.CO] (Published 2018-03-31, updated 2018-06-05)
Binomial Inequalities of Chromatic, Flow, and Ehrhart Polynomials
arXiv:2106.08183 [math.CO] (Published 2021-06-15)
Ehrhart polynomials of rank two matroids