06-51
A primal Barvinok algorithm based on irrational decompositions
Preprint series: 06-51, Preprints
- MSC:
- 05A15 Exact enumeration problems, generating functions, See Also {33Cxx, 33Dxx}
- 52C07 Lattices and convex bodies in $n$ dimensions, See Also {11H06, 11H31, 11P21}
Abstract: We introduce variants of Barvinok\'s algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with low index. We give computational results that show that the new algorithms are faster than the existing algorithms by a large factor.
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.