Algebraic Unimodular Counting
Skip to main content
Open Access Publications from the University of California

Department of Mathematics

Faculty bannerUC Davis

Algebraic Unimodular Counting

Published Web Location
No data is associated with this publication.

We study algebraic algorithms for expressing the number of non-negative integer solutions to a unimodular system of linear equations as a function of the right hand side. Our methods include Todd classes of toric varieties via Gr\"obner bases, and rational generating functions as in Barvinok's algorithm. We report polyhedral and computational results for two special cases: counting contingency tables and Kostant's partition function.

Item not freely available? Link broken?
Report a problem accessing this item