{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:44:40Z","timestamp":1776977080382,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T00:00:00Z","timestamp":1210291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s00454-008-9080-z","type":"journal-article","created":{"date-parts":[[2008,5,8]],"date-time":"2008-05-08T16:11:28Z","timestamp":1210263088000},"page":"670-702","source":"Crossref","is-referenced-by-count":25,"title":["Ehrhart Polynomials of Matroid Polytopes and\u00a0Polymatroids"],"prefix":"10.1007","volume":"42","author":[{"given":"Jes\u00fas A.","family":"De Loera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David C.","family":"Haws","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"K\u00f6ppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,9]]},"reference":[{"key":"9080_CR1","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A.I. Barvinok","year":"1994","unstructured":"Barvinok, A.I.: Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19, 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"issue":"255","key":"9080_CR2","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1090\/S0025-5718-06-01836-9","volume":"75","author":"A.I. Barvinok","year":"2006","unstructured":"Barvinok, A.I.: Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75(255), 1449\u20131466 (2006) (electronic)","journal-title":"Math. Comput."},{"key":"9080_CR3","series-title":"Math. Sci. Res. Inst. Publ.","first-page":"91","volume-title":"New Perspectives in Algebraic Combinatorics","author":"A.I. Barvinok","year":"1999","unstructured":"Barvinok, A.I., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. In: Billera, L.J., Bj\u00f6rner, A., Greene, C., Simion, R.E., Stanley, R.P. (eds.) New Perspectives in Algebraic Combinatorics. Math. Sci. Res. Inst. Publ., vol. 38, pp. 91\u2013147. Cambridge University Press, Cambridge (1999)"},{"issue":"4","key":"9080_CR4","first-page":"957","volume":"16","author":"A.I. Barvinok","year":"2003","unstructured":"Barvinok, A.I., Woods, K.: Short rational generating functions for lattice point problems. J. AMS 16(4), 957\u2013979 (2003)","journal-title":"J. AMS"},{"key":"9080_CR5","volume-title":"Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra","author":"M. Beck","year":"2007","unstructured":"Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra. Springer, Berlin (2007)"},{"issue":"1","key":"9080_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ejc.2005.06.003","volume":"28","author":"M. Beck","year":"2007","unstructured":"Beck, M., Sottile, F.: Irrational proofs for three theorems of Stanley. Eur. J. Comb. 28(1), 403\u2013409 (2007)","journal-title":"Eur. J. Comb."},{"key":"9080_CR7","unstructured":"Beck, M., Haase, C., Sottile, F.: Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones. Eprint arXiv:math.CO\/0506466 (2006)"},{"key":"9080_CR8","unstructured":"Billera, L.J., Jia, N., Reiner, V.: A quasisymmetric function for matroids. Eprint arXiv:math\/0606646 (2006)"},{"issue":"3","key":"9080_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G. Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225\u2013242 (1991)","journal-title":"Order"},{"issue":"4","key":"9080_CR10","doi-asserted-by":"crossref","first-page":"653","DOI":"10.24033\/asens.1572","volume":"21","author":"M. Brion","year":"1988","unstructured":"Brion, M.: Points entiers dans les poly\u00e9dres convexes. Ann. Sci. \u00c9c. Norm. Sup. 21(4), 653\u2013663 (1988)","journal-title":"Ann. Sci. \u00c9c. Norm. Sup."},{"issue":"2","key":"9080_CR11","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.jsc.2004.02.001","volume":"38","author":"J.A. Loera De","year":"2004","unstructured":"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\u2013973 (2004)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9080_CR12","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"J.A. Loera De","year":"2004","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273\u20131302 (2004)","journal-title":"J. Symb. Comput."},{"key":"9080_CR13","unstructured":"De Loera, J.A., Haws, D.C., Hemmecke, R., Huggins, P., Tauzer, J., Yoshida, R.: Software and User\u2019s Guide for Latte v.1.1 (2005). http:\/\/www.math.ucdavis.edu\/~latte"},{"key":"9080_CR14","unstructured":"De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Applications, Structures, Algorithms. Book Manuscript (2006)"},{"key":"9080_CR15","unstructured":"De Loera, J.A., Haws, D.C., K\u00f6ppe, M.: Matroid Polytopes (2007). http:\/\/math.ucdavis.edu\/~haws\/Matroids\/"},{"issue":"2","key":"9080_CR16","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1006\/jabr.1997.6990","volume":"193","author":"E. Negri De","year":"1997","unstructured":"De Negri, E., Hibi, T.: Gorenstein algebras of Veronese type. J. Algebra 193(2), 629\u2013639 (1997), 1997","journal-title":"J. Algebra"},{"issue":"5","key":"9080_CR17","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1137\/0217060","volume":"17","author":"M.E. Dyer","year":"1988","unstructured":"Dyer, M.E., Frieze, A.M.: On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5), 967\u2013974 (1988). ISSN 0097-5397","journal-title":"SIAM J. Comput."},{"key":"9080_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-36478-1_2","volume-title":"Combinatorial Optimization\u2014Eureka, You Shrink! Papers Dedicated to Jack Edmonds. 5th International Workshop, Revised Papers","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization\u2014Eureka, You Shrink! Papers Dedicated to Jack Edmonds. 5th International Workshop, Revised Papers, Aussois, France, 5\u20139 March 2001. Lecture Notes in Computer Science, vol. 2570, pp. 11\u201326. Springer, Berlin (2003)"},{"issue":"4","key":"9080_CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02187701","volume":"1","author":"G. Elekes","year":"1986","unstructured":"Elekes, G.: A geometric inequality and the complexity of computing volume. Discrete Comput. Geom. 1(4), 289\u2013292 (1986), 1986","journal-title":"Discrete Comput. Geom."},{"key":"9080_CR20","first-page":"437","volume":"62","author":"E.M. Feichtner","year":"2005","unstructured":"Feichtner, E.M., Sturmfels, B.: Matroid polytopes, nested sets and Bergman fans. Port. Math. 62, 437\u2013468 (2005)","journal-title":"Port. Math."},{"key":"9080_CR21","unstructured":"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"},{"key":"9080_CR22","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0001-8708(87)90059-4","volume":"63","author":"I.M. Gelfand","year":"1987","unstructured":"Gelfand, I.M., Goresky, M., MacPherson, R.D., Serganova, V.V.: Combinatorial geometries, convex polyhedra, and Schubert cells. Adv. Math. 63, 301\u2013316 (1987)","journal-title":"Adv. Math."},{"key":"9080_CR23","volume-title":"Handbook of Discrete and Computational Geometry","year":"1997","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)"},{"key":"9080_CR24","volume-title":"Algebraic Combinatorics on Convex Polytopes","author":"T. Hibi","year":"1992","unstructured":"Hibi, T.: Algebraic Combinatorics on Convex Polytopes. Carslaw, Glebe (1992)"},{"key":"9080_CR25","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1081\/AGB-200053828","volume":"33","author":"M. Katzman","year":"2005","unstructured":"Katzman, M.: The Hilbert series of algebras of Veronese type. Commun. Algebra 33, 1141\u20131146 (2005)","journal-title":"Commun. Algebra"},{"key":"9080_CR26","series-title":"Algorithms Combin.","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-58043-7_5","volume-title":"New Trends in Discrete and Computational Geometry","author":"L. Khachiyan","year":"1993","unstructured":"Khachiyan, L.: Complexity of polytope volume computation. In: New Trends in Discrete and Computational Geometry. Algorithms Combin., vol. 10, pp. 91\u2013101. Springer, Berlin (1993)"},{"issue":"1","key":"9080_CR27","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1137\/060664768","volume":"21","author":"M. K\u00f6ppe","year":"2007","unstructured":"K\u00f6ppe, M.: A primal Barvinok algorithm based on irrational decompositions. SIAM J. Discrete Math. 21(1), 220\u2013236 (2007). doi: 10.1137\/060664768","journal-title":"SIAM J. Discrete Math."},{"key":"9080_CR28","unstructured":"K\u00f6ppe, M.: LattE macchiato, version 1.2-mk-0.9, an improved version of De Loera et al.\u2019s LattE program for counting integer points in polyhedra with variants of Barvinok\u2019s algorithm (2007). Available from URL http:\/\/www.math.uni-magdeburg.de\/~mkoeppe\/latte\/"},{"key":"9080_CR29","doi-asserted-by":"crossref","first-page":"R16","DOI":"10.37236\/740","volume":"15","author":"M. K\u00f6ppe","year":"2008","unstructured":"K\u00f6ppe, M., Verdoolaege, S.: Computing parametric rational generating functions with a primal Barvinok algorithm. Electron. J. Comb. 15, R16 (2008)","journal-title":"Electron. J. Comb."},{"issue":"195","key":"9080_CR30","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1090\/S0025-5718-1991-1079024-2","volume":"57","author":"J. Lawrence","year":"1991","unstructured":"Lawrence, J.: Polytope volume computation. Math. Comput. 57(195), 259\u2013271 (1991)","journal-title":"Math. Comput."},{"key":"9080_CR31","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci.","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/dimacs\/006\/12","volume-title":"Discrete and Computational Geometry","author":"J. Lawrence","year":"1991","unstructured":"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\u2013208. AMS, Providence (1991)"},{"key":"9080_CR32","volume-title":"Matroid Theory","author":"J. Oxley","year":"1992","unstructured":"Oxley, J.: Matroid Theory. Oxford University Press, New York (1992)"},{"key":"9080_CR33","volume-title":"A=B","author":"M. Petkov\u0161ek","year":"1996","unstructured":"Petkov\u0161ek, M., Wilf, H.S., Zeilberger, D.: A=B. AK Peters, Wellesley (1996). http:\/\/www.math.upenn.edu\/~wilf\/AeqB.html"},{"key":"9080_CR34","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"9080_CR35","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"9080_CR36","unstructured":"Speyer, D.E.: A matroid invariant via the K-theory of the Grassmannian. Eprint arXiv:math\/0603551v1 (2006)"},{"key":"9080_CR37","volume-title":"Combinatorics and Commutative Algebra","author":"R.P. Stanley","year":"1996","unstructured":"Stanley, R.P.: Combinatorics and Commutative Algebra, 2nd edn. Birkh\u00e4user, Boston (1996)","edition":"2"},{"key":"9080_CR38","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics","author":"R.P. Stanley","year":"1997","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol.\u00a01. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"9080_CR39","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02591887","volume":"30","author":"D.M. Topkis","year":"1984","unstructured":"Topkis, D.M.: Adjacency on polymatroids. Math. Program. 30(2), 229\u2013237 (1984)","journal-title":"Math. Program."},{"issue":"2","key":"9080_CR40","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.jsc.2007.07.007","volume":"43","author":"S. Verdoolaege","year":"2008","unstructured":"Verdoolaege, S., Woods, K.M.: Counting with rational generating functions. J. Symb. Comput. 43(2), 75\u201391 (2008). doi: http:\/\/dx.doi.org\/10.1016\/j.jsc.2007.07.007 . ISSN 0747-7171","journal-title":"J. Symb. Comput."},{"key":"9080_CR41","volume-title":"Matroid Theory","author":"D. Welsh","year":"1976","unstructured":"Welsh, D.: Matroid Theory. Academic Press, San Diego (1976)"},{"key":"9080_CR42","unstructured":"Woods, K.: Rational generating functions and lattice point sets. Ph.D. thesis, University of Michigan (2004)"}],"updated-by":[{"DOI":"10.1007\/s00454-008-9120-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T00:00:00Z","timestamp":1224028800000}}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9080-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-008-9080-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9080-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T11:21:14Z","timestamp":1588677674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-008-9080-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,9]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9080"],"URL":"https:\/\/doi.org\/10.1007\/s00454-008-9080-z","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00454-008-9120-8","asserted-by":"object"}]},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,9]]}}}