Computing parametric rational generating functions with a primal Barvinok algorithm
From MaRDI portal
Publication:1010722
zbMath1180.52014arXiv0705.3651MaRDI QIDQ1010722
Sven Verdoolaege, Matthias Köppe
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.3651
Symbolic computation and algebraic computation (68W30) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational aspects related to convexity (52B55) Dissections and valuations (Hilbert's third problem, etc.) (52B45) Combinatorial complexity of geometric structures (52C45)
Related Items
Polyhedral omega: a new algorithm for solving linear Diophantine systems, On lattice point counting in \(\varDelta\)-modular polyhedra, Computing convex hulls and counting integer points with \texttt{polymake}, Combinatorial mixed valuations, Ehrhart tensor polynomials, Three Ehrhart quasi-polynomials, \(h^*\) -vectors of graph polytopes using activities of dissecting spanning trees, The power of pyramid decomposition in Normaliz, Enumeration and unimodular equivalence of empty delta-modular simplices, Computing with an algebraic-perturbation variant of Barvinok's algorithm, ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES, The computation of generalized Ehrhart series in normaliz, The Martin Gardner Polytopes, Enumerating Projections of Integer Points in Unbounded Polyhedra, $h^\ast $-polynomials of zonotopes, On the relationship between Ehrhart unimodality and Ehrhart positivity, Lipschitz polytopes of posets and permutation statistics, Ehrhart polynomials of matroid polytopes and polymatroids
Uses Software
