Abstract
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, Ehrhart polynomials of matroid polytopes and polymatroids 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Barvinok, A.I.: Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19, 769–779 (1994)
Barvinok, A.I.: Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75(255), 1449–1466 (2006) (electronic)
Barvinok, A.I., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. In: Billera, L.J., Björner, A., Greene, C., Simion, R.E., Stanley, R.P. (eds.) New Perspectives in Algebraic Combinatorics. Math. Sci. Res. Inst. Publ., vol. 38, pp. 91–147. Cambridge University Press, Cambridge (1999)
Barvinok, A.I., Woods, K.: Short rational generating functions for lattice point problems. J. AMS 16(4), 957–979 (2003)
Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra. Springer, Berlin (2007)
Beck, M., Sottile, F.: Irrational proofs for three theorems of Stanley. Eur. J. Comb. 28(1), 403–409 (2007)
Beck, M., Haase, C., Sottile, F.: Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones. Eprint arXiv:math.CO/0506466 (2006)
Billera, L.J., Jia, N., Reiner, V.: A quasisymmetric function for matroids. Eprint arXiv:math/0606646 (2006)
Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225–242 (1991)
Brion, M.: Points entiers dans les polyédres convexes. Ann. Sci. Éc. Norm. Sup. 21(4), 653–663 (1988)
De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Sturmfels, B., Yoshida, R.: Short rational functions for toric algebra and applications. J. Symb. Comput. 38(2), 959–973 (2004)
De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273–1302 (2004)
De Loera, J.A., Haws, D.C., Hemmecke, R., Huggins, P., Tauzer, J., Yoshida, R.: Software and User’s Guide for Latte v.1.1 (2005). http://www.math.ucdavis.edu/~latte
De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Applications, Structures, Algorithms. Book Manuscript (2006)
De Loera, J.A., Haws, D.C., Köppe, M.: Matroid Polytopes (2007). http://math.ucdavis.edu/~haws/Matroids/
De Negri, E., Hibi, T.: Gorenstein algebras of Veronese type. J. Algebra 193(2), 629–639 (1997), 1997
Dyer, M.E., Frieze, A.M.: On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5), 967–974 (1988). ISSN 0097-5397
Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization—Eureka, You Shrink! Papers Dedicated to Jack Edmonds. 5th International Workshop, Revised Papers, Aussois, France, 5–9 March 2001. Lecture Notes in Computer Science, vol. 2570, pp. 11–26. Springer, Berlin (2003)
Elekes, G.: A geometric inequality and the complexity of computing volume. Discrete Comput. Geom. 1(4), 289–292 (1986), 1986
Feichtner, E.M., Sturmfels, B.: Matroid polytopes, nested sets and Bergman fans. Port. Math. 62, 437–468 (2005)
Fukuda, K.: cdd+, a C++ implementation of the double description method of Motzkin et al. (2006). Available from URL http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html
Gelfand, I.M., Goresky, M., MacPherson, R.D., Serganova, V.V.: Combinatorial geometries, convex polyhedra, and Schubert cells. Adv. Math. 63, 301–316 (1987)
Goodman, J.E., O’Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)
Hibi, T.: Algebraic Combinatorics on Convex Polytopes. Carslaw, Glebe (1992)
Katzman, M.: The Hilbert series of algebras of Veronese type. Commun. Algebra 33, 1141–1146 (2005)
Khachiyan, L.: Complexity of polytope volume computation. In: New Trends in Discrete and Computational Geometry. Algorithms Combin., vol. 10, pp. 91–101. Springer, Berlin (1993)
Köppe, M.: A primal Barvinok algorithm based on irrational decompositions. SIAM J. Discrete Math. 21(1), 220–236 (2007). doi:10.1137/060664768
Köppe, M.: LattE macchiato, version 1.2-mk-0.9, an improved version of De Loera et al.’s LattE program for counting integer points in polyhedra with variants of Barvinok’s algorithm (2007). Available from URL http://www.math.uni-magdeburg.de/~mkoeppe/latte/
Köppe, M., Verdoolaege, S.: Computing parametric rational generating functions with a primal Barvinok algorithm. Electron. J. Comb. 15, R16 (2008)
Lawrence, J.: Polytope volume computation. Math. Comput. 57(195), 259–271 (1991)
Lawrence, J.: Rational-function-valued valuations on polyhedra. In: Discrete and Computational Geometry, New Brunswick, NJ, 1989/1990. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 6, pp. 199–208. AMS, Providence (1991)
Oxley, J.: Matroid Theory. Oxford University Press, New York (1992)
Petkovšek, M., Wilf, H.S., Zeilberger, D.: A=B. AK Peters, Wellesley (1996). http://www.math.upenn.edu/~wilf/AeqB.html
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
Speyer, D.E.: A matroid invariant via the K-theory of the Grassmannian. Eprint arXiv:math/0603551v1 (2006)
Stanley, R.P.: Combinatorics and Commutative Algebra, 2nd edn. Birkhäuser, Boston (1996)
Stanley, R.P.: Enumerative Combinatorics, vol. 1. Cambridge University Press, Cambridge (1997)
Topkis, D.M.: Adjacency on polymatroids. Math. Program. 30(2), 229–237 (1984)
Verdoolaege, S., Woods, K.M.: Counting with rational generating functions. J. Symb. Comput. 43(2), 75–91 (2008). doi:http://dx.doi.org/10.1016/j.jsc.2007.07.007. ISSN 0747-7171
Welsh, D.: Matroid Theory. Academic Press, San Diego (1976)
Woods, K.: Rational generating functions and lattice point sets. Ph.D. thesis, University of Michigan (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
An erratum to this article can be found at http://dx.doi.org/10.1007/s00454-008-9120-8
Rights and permissions
About this article
Cite this article
De Loera, J.A., Haws, D.C. & Köppe, M. Ehrhart Polynomials of Matroid Polytopes and Polymatroids. Discrete Comput Geom 42, 670–702 (2009). https://doi.org/10.1007/s00454-008-9080-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9080-z