Zurück zu den Preprints des Jahres 2006


A primal Barvinok algorithm based on irrational decompositions

by Köppe, Matthias.

Series: 2006-51, Preprints

05A15 Exact enumeration problems, generating functions
52C07 Lattices and convex bodies in $n$ dimensions

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.