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

DOI10.1007/s10208-011-9106-4zbMath1255.05006arXiv1011.1602OpenAlexW2098122576MaRDI QIDQ695630

Jesús A. De Loera, Matthias Köppe, Michèle Vergne, M. Welleda Baldoni Silva, Nicole Berline

Publication date: 21 December 2012

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polynomial-time algorithmsBarvinok's methodcounting lattice points inside convex polytopesEhrhart functionsexponential sums and integralshighest degree coefficientsintermediate sumsrational simple polytopeweighted Ehrhart quasi-polynomial

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

On the score sheets of a round-robin football tournament, Three Ehrhart quasi-polynomials, Notes on K-Semistability of Toric Polarized Varieties, Dilated floor functions having nonnegative commutator I. Positive and mixed sign dilations, Tropical Ehrhart theory and tropical volume, Exploiting polyhedral symmetries in social choice, On the number of integer points in translated and expanded polyhedra, The computation of generalized Ehrhart series in normaliz, Enumerating Projections of Integer Points in Unbounded Polyhedra, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Strange expectations and simultaneous cores, Computations of volumes and Ehrhart series in four candidates elections, On the polynomiality of orbifold Gromov-Witten theory of root stacks, Exploiting Symmetries in Polyhedral Computations

Uses Software

• Maple
• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• Integer points in polyhedra
• Triangulations. Structures for algorithms and applications
• Primal-dual methods for vertex and facet enumeration
• Pick's theorem and the Todd class of a toric variety
• Computing the Ehrhart polynomial of a convex lattice polytope
• Lattice points, Dedekind sums, and Ehrhart polynomials of lattice polyhedra
• Counting with rational generating functions
• The many aspects of counting lattice points in polytopes
• Effective lattice point counting in rational convex polytopes
• How to integrate a polynomial over a simplex
• Computing the Continuous Discretely
• Points entiers dans les polyèdres convexes
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Lattice points in simple polytopes
• 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
• INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY
• Integer Polynomial Optimization in Fixed Dimension
• A Primal Barvinok Algorithm Based on Irrational Decompositions
• Computing the Ehrhart quasi-polynomial of a rational simplex