Algebraic Unimodular Counting

Simple item page
dc.creatorDe Loera, Jesus A.
dc.creatorSturmfels, Bernd
dc.date2001-04-30
dc.date.accessioned2026-07-07T04:41:32Z
dc.date.available2026-07-07T04:41:32Z
dc.descriptionWe 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öbner 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/math/0104286
dc.identifierhttp://arxiv.org/abs/math/0104286
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61397
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subjectAlgebraic Geometry
dc.subject05A15; 13P10; 52B20; 68W30
dc.titleAlgebraic Unimodular Counting
dc.typetext

Files

Collections

arXiv