An algebraic-perturbation variant of Barvinok's algorithm

Jon Lee, Daphne Skipper

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We give a variant of Barvinok's algorithm for computing a short rational generating function for the integer points in P := {x ∈ Rn : Ax ≤ b}; a use of which is to count the number of integer points in P. We use an algebraic perturbation, replacing each bi with bii, where τ>0 is an arbitrarily small indeterminate. Hence, our new right-hand vector has components in the ordered ring Q[τ] of polynomials in τ. Denoting the perturbed polyhedron by P(τ)⊂R[τ]n, we use the facts that: P(τ) is full dimensional, simple, and contains the same integer points as P.

Original languageEnglish (US)
Pages (from-to)15-20
Number of pages6
JournalElectronic Notes in Discrete Mathematics
StatePublished - Dec 1 2015


  • Barvinok's algorithm
  • Generating function
  • Integer
  • Polyhedron

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'An algebraic-perturbation variant of Barvinok's algorithm'. Together they form a unique fingerprint.

Cite this