Skip to main content
Article thumbnail
Location of Repository

Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra

By Velleda Baldoni, Nicole Berline, Jesús A. De Loera, Matthias Köppe and Michèle Vergne


34 pages, 2 figuresInternational audienceThis article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree coefficients of the weighted Ehrhart quasi-polynomial for a rational simple polytope in varying dimension, when the weights of the lattice points are given by a polynomial function h. Our technique is based on a refinement of an algorithm of A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), pp. 1449--1466] in the unweighted case (i.e., h = 1). In contrast to Barvinok's method, our method is local, obtains an approximation on the level of generating functions, handles the general weighted case, and provides the coefficients in closed form as step polynomials of the dilation. To demonstrate the practicality of our approach we report on computational experiments which show even our simple implementation can compete with state of the art software

Topics: [ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG], [ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]
Publisher: Springer Verlag
Year: 2012
DOI identifier: 10.1007/s10208-011-9106-4
OAI identifier: oai:HAL:hal-00826517v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.