Algebraic unimodular counting (Q1424267)

The vector partition function \(\Phi_A(b) = \#\{x: Ax = b, x \geq 0, x \text{ integer}\}\) is studied, where \(A\) is a \(d \times n\) unimodular matrix and \(b\) is a variable integer vector. Unimodular counting refers to preprocessing \(A\) and generating the polynomials for \(\Phi_A\) on the domains of polynomiality (chambers). Two methods for finding a chamber that contains \(b\) and for enumerating all chambers are given. The first uses Gröbner bases, the second is based on Barvinok's polynomial time algorithm for counting lattice points in rational polytopes of fixed dimension. Results on two special cases, counting contingency tables and the Kostant partition function, are given.