Short rational generating functions for lattice point problems
| dc.creator | Barvinok, Alexander | |
| dc.creator | Woods, Kevin | |
| dc.date | 2002-11-08 | |
| dc.date.accessioned | 2026-07-07T04:52:47Z | |
| dc.date.available | 2026-07-07T04:52:47Z | |
| dc.description | We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice points, notably integer semigroups and (minimal) Hilbert bases of rational cones, have short rational generating functions provided certain parameters (the dimension and the number of generators) are fixed. It follows then that many computational problems for such sets (for example, finding the number of positive integers not representable as a non-negative integer combination of given coprime positive integers a_1 ... a_d admit polynomial time algorithms. We also discuss a related problem of computing the Hilbert series of a ring generated by monomials. | |
| dc.description | 26 pages | |
| dc.identifier | https://arxiv.org/abs/math/0211146 | |
| dc.identifier | http://arxiv.org/abs/math/0211146 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65600 | |
| dc.subject | Combinatorics | |
| dc.subject | Commutative Algebra | |
| dc.subject | Optimization and Control | |
| dc.subject | 05A15, 11P21, 13P10, 68W30 | |
| dc.title | Short rational generating functions for lattice point problems | |
| dc.type | text |