Computing parametric rational generating functions with a primal Barvinok algorithm
The electronic journal of combinatorics, Tome 15 (2008)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
Computations with Barvinok's short rational generating functions are traditionally being performed in the dual space, to avoid the combinatorial complexity of inclusion–exclusion formulas for the intersecting proper faces of cones. We prove that, on the level of indicator functions of polyhedra, there is no need for using inclusion–exclusion formulas to account for boundary effects: All linear identities in the space of indicator functions can be purely expressed using partially open variants of the full-dimensional polyhedra in the identity. This gives rise to a practically efficient, parametric Barvinok algorithm in the primal space.
Matthias Köppe; Sven Verdoolaege. Computing parametric rational generating functions with a primal Barvinok algorithm. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/740
@article{10_37236_740,
author = {Matthias K\"oppe and Sven Verdoolaege},
title = {Computing parametric rational generating functions with a primal {Barvinok} algorithm},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/740},
zbl = {1180.52014},
url = {http://geodesic.mathdoc.fr/articles/10.37236/740/}
}
Cité par Sources :