The partial-fractions method for counting solutions to integral linear systems
From MaRDI portal
Abstract: We present a new tool to compute the number of integer solutions to the linear system x geq 0 qquad A x = � where the coefficients of and are integral. is often described as a emph{vector partition function}. Our methods use partial fraction expansions of Euler's generating function for . A special class of vector partition functions are Ehrhart (quasi-)polynomials counting integer points in dilated polytopes.
Recommendations
Cited in
(13)- Discrete truncated powers and lattice points in rational polytope.
- On polynomials counting essentially irreducible maps
- Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds
- Counting with rational generating functions
- Counting integral Lamé equations by means of dessins d’enfants
- On The Number of Nonnegative Integer Solutions of a System of Linear Diophantine Equations
- The unreasonable ubiquitousness of quasi-polynomials
- From Gehrlein-Fishburn’s Method on Frequency Representation to a Direct Proof of Ehrhart’s extended Conjecture
- Computing Optimized Path Integrals for Knapsack Feasibility
- A new and faster representation for counting integer points in parametric polyhedra
- Partial fraction decompositions on hyperplane arrangements
- The continued fraction methods for the solution of systems of linear equations
- From amplitudes to contact cosmological correlators
This page was built for publication: The partial-fractions method for counting solutions to integral linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764158)