# A primal Barvinok algorithm based on irrational decompositions

Source: [A primal Barvinok algorithm based on irrational decompositions](<https://www.sota2.com/research/paper/68fa53921e209131ce9844d8>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T12:31:14.184Z

Authors: Matthias K\\"oppe

Published: 2006-03-13T19:58:05.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/math/0603308>)

[PDF](<https://arxiv.org/pdf/math/0603308.pdf>)
