Algebraic Unimodular Counting

Details Algebraic Unimodular Counting Algebraic Unimodular Counting

2001-04-30

arxiv.org/abs/math/0104286v1

Mathematics

Combinatorics

21 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algebraic Unimodular Counting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Unimodular Counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Unimodular Counting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-287937