INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY

DOI10.1112/S0025579312000101zbMath1260.05006arXiv1011.6002MaRDI QIDQ4911021

Michèle Vergne, Matthias Köppe, Nicole Berline, M. Welleda Baldoni Silva

Publication date: 13 March 2013

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.6002

zbMATH Keywords

polynomial functionEhrhart theoryintermediate sumsdilation of a polytopeEhrhart quasi-plynomialsexplicit step-polynomialsparametric intermediate generating functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Centerpoints: A Link Between Optimization and Convex Geometry, On lattice point counting in \(\varDelta\)-modular polyhedra, Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes, Three Ehrhart quasi-polynomials, Rational Ehrhart theory, Dilated floor functions having nonnegative commutator I. Positive and mixed sign dilations, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Centerpoints: A Link between Optimization and Convex Geometry, Rational Ehrhart quasi-polynomials, Lattice points in algebraic cross-polytopes and simplices

Cites Work

• Rational Ehrhart quasi-polynomials
• Reverse search for enumeration
• Counting with rational generating functions
• How to integrate a polynomial over a simplex
• Points entiers dans les polyèdres convexes
• Residue formulae, vector partition functions and lattice points in rational polytopes
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• A Primal Barvinok Algorithm Based on Irrational Decompositions
• Computing the Ehrhart quasi-polynomial of a rational simplex