Ehrhart polynomials of matroid polytopes and polymatroids
DOI10.1007/s00454-008-9080-zzbMath1207.52015arXiv0710.4346OpenAlexW3105025084MaRDI QIDQ1042445
Matthias Köppe, David C. Haws, Jesús A. De Loera
Publication date: 14 December 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.4346
rational generating functionsmatroidpolymatroidsunimodalityvolume computationEhrhart polynomialsTodd polynomialsmatroid polytopes\(h^{*}\)-vector
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid polytopes, nested sets and Bergman fans
- Irrational proofs for three theorems of Stanley
- Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
- Computing parametric rational generating functions with a primal Barvinok algorithm
- A matroid invariant via the \(K\)-theory of the Grassmannian
- A quasisymmetric function for matroids
- Ehrhart polynomials of matroid polytopes and polymatroids
- A geometric inequality and the complexity of computing volume
- Combinatorial geometries, convex polyhedra, and Schubert cells
- Counting linear extensions
- Gorenstein algebras of Veronese type
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorics and commutative algebra.
- Counting with rational generating functions
- Short rational functions for toric algebra and applications
- Effective lattice point counting in rational convex polytopes
- Adjacency on polymatroids
- Polytope Volume Computation
- Computing the Continuous Discretely
- Points entiers dans les polyèdres convexes
- On the Complexity of Computing the Volume of a Polyhedron
- Short rational generating functions for lattice point problems
- THE HILBERT SERIES OF ALGEBRAS OF THE VERONESE TYPE
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Computing the Ehrhart quasi-polynomial of a rational simplex