The partial-fractions method for counting solutions to integral linear systems
From MaRDI portal
Publication:1764158
DOI10.1007/s00454-004-1131-5zbMath1196.11054arXivmath/0309332OpenAlexW2056025450MaRDI QIDQ1764158
Publication date: 23 February 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0309332
number of integer solutions to a linear Diophantine systempartial fraction expansions of Euler's generating functionvector partition functions
Counting solutions of Diophantine equations (11D45) Linear Diophantine equations (11D04) Matrices of integers (15B36)
Related Items (7)
From amplitudes to contact cosmological correlators ⋮ On polynomials counting essentially irreducible maps ⋮ Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials ⋮ The unreasonable ubiquitousness of quasi-polynomials ⋮ Computing Optimized Path Integrals for Knapsack Feasibility ⋮ Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds ⋮ Counting with rational generating functions
Uses Software
This page was built for publication: The partial-fractions method for counting solutions to integral linear systems