English

Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory

Combinatorics 2014-01-14 v1 Computational Geometry

Abstract

We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational polytope P and a rational subspace L, we integrate a given polynomial function h over all lattice slices of the polytope P parallel to the subspace L and sum up the integrals. We first develop an algorithmic theory of parametric intermediate generating functions. Then we study the Ehrhart theory of these intermediate sums, that is, the dependence of the result as a function of a dilation of the polytope. We provide an algorithm to compute the resulting Ehrhart quasi-polynomials in the form of explicit step polynomials. These formulas are naturally valid for real (not just integer) dilations and thus provide a direct approach to real Ehrhart theory.

Keywords

Cite

@article{arxiv.1011.6002,
  title  = {Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory},
  author = {Velleda Baldoni and Nicole Berline and Matthias Köppe and Michèle Vergne},
  journal= {arXiv preprint arXiv:1011.6002},
  year   = {2014}
}

Comments

24 pages, 3 figures

R2 v1 2026-06-21T16:49:50.646Z