A primal Barvinok algorithm based on irrational decompositions
Combinatorics
2017-01-03 v4
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.
Cite
@article{arxiv.math/0603308,
title = {A primal Barvinok algorithm based on irrational decompositions},
author = {Matthias Köppe},
journal= {arXiv preprint arXiv:math/0603308},
year = {2017}
}
Comments
v3: New all-primal algorithm. v4: Extended introduction, updated computational results. To appear in SIAM Journal on Discrete Mathematics