A Primal Barvinok Algorithm Based on Irrational Decompositions
From MaRDI portal
Publication:5454273
DOI10.1137/060664768zbMath1135.05003arXivmath/0603308OpenAlexW2160273855MaRDI QIDQ5454273
Publication date: 28 March 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603308
Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)
Related Items
Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws, Computing convex hulls and counting integer points with \texttt{polymake}, Minkowski length of 3D lattice polytopes, The combinatorics of interval vector polytopes, Symmetrically constrained compositions, Computing Optimized Path Integrals for Knapsack Feasibility, Computing with an algebraic-perturbation variant of Barvinok's algorithm, A Euclid style algorithm for MacMahon's partition analysis, Enumerating Projections of Integer Points in Unbounded Polyhedra, INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY, Mahonian Partition Identities via Polyhedral Geometry, Counting with rational generating functions, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones., Reachability analysis of low-order discrete state reaction networks obeying conservation laws, Ehrhart polynomials of matroid polytopes and polymatroids
Uses Software
