Computing with an algebraic-perturbation variant of Barvinok’s algorithm

Computing with an algebraic-perturbation variant of Barvinok’s algorithm We present a variant of Barvinok’s algorithm for computing a short rational generating function for the integer points in a nonempty pointed polyhedron P:={x∈Rn:Ax≤b} given by rational inequalities. A main use of such a rational generating function is to count the number of integer points in P.Our variant is based on making an algebraic perturbation of the right-hand side b∈Qm of the inequalities, replacing each bi with bi+τi, where τ is considered to be an arbitrarily small positive real indeterminate. Hence, elements of our right-hand side vector become elements of the ordered ring Q[τ] of polynomials in τ. Denoting the algebraically-perturbed polyhedron as P(τ)⊂R[τ]n, we readily see that: (i) P(τ) is always full dimensional, (ii) P(τ) is always simple, and (iii) P(τ) contains the same integer points as P. Unlike other versions of Barvinok’s algorithm, we will have to do some arithmetic in Q[τ]. However, because of (i) we will not need to preprocess our input polyhedron if it is not full dimensional, and because of (ii) we will not need to triangulate tangent cones at the vertices of the polyhedron.We give the details of our perturbation variant of Barvinok’s algorithm, describe a proof-of-concept implementation developed in Mathematica, and present results of computational experiments. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Applied Mathematics Elsevier

Computing with an algebraic-perturbation variant of Barvinok’s algorithm

Loading next page...
 
/lp/elsevier/computing-with-an-algebraic-perturbation-variant-of-barvinok-s-QsBIf06rCN
Publisher
North-Holland
Copyright
Copyright © 2015 Elsevier B.V.
ISSN
0166-218X
D.O.I.
10.1016/j.dam.2015.12.003
Publisher site
See Article on Publisher Site

Abstract

We present a variant of Barvinok’s algorithm for computing a short rational generating function for the integer points in a nonempty pointed polyhedron P:={x∈Rn:Ax≤b} given by rational inequalities. A main use of such a rational generating function is to count the number of integer points in P.Our variant is based on making an algebraic perturbation of the right-hand side b∈Qm of the inequalities, replacing each bi with bi+τi, where τ is considered to be an arbitrarily small positive real indeterminate. Hence, elements of our right-hand side vector become elements of the ordered ring Q[τ] of polynomials in τ. Denoting the algebraically-perturbed polyhedron as P(τ)⊂R[τ]n, we readily see that: (i) P(τ) is always full dimensional, (ii) P(τ) is always simple, and (iii) P(τ) contains the same integer points as P. Unlike other versions of Barvinok’s algorithm, we will have to do some arithmetic in Q[τ]. However, because of (i) we will not need to preprocess our input polyhedron if it is not full dimensional, and because of (ii) we will not need to triangulate tangent cones at the vertices of the polyhedron.We give the details of our perturbation variant of Barvinok’s algorithm, describe a proof-of-concept implementation developed in Mathematica, and present results of computational experiments.

Journal

Discrete Applied MathematicsElsevier

Published: May 11, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial