Algebraic Unimodular Counting
组合数学
2007-05-23 v1 交换代数
代数几何
摘要
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.
引用
@article{arxiv.math/0104286,
title = {Algebraic Unimodular Counting},
author = {Jesus A. De Loera and Bernd Sturmfels},
journal= {arXiv preprint arXiv:math/0104286},
year = {2007}
}
备注
21 pages