Mathematics – Combinatorics
Scientific paper
2007-10-23
Mathematics
Combinatorics
28 pages, 6 figures, submitted to Discrete and Computational Geometry
Scientific paper
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.
de Loera Jesus A.
Haws David C.
Köppe Matthias
No associations
LandOfFree
Ehrhart polynomials of matroid polytopes and polymatroids 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 Ehrhart polynomials of matroid polytopes and polymatroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ehrhart polynomials of matroid polytopes and polymatroids will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-654506