Three Ehrhart quasi-polynomials
DOI10.5802/alco.46zbMath1419.52014arXiv1410.8632OpenAlexW2968678509WikidataQ127736123 ScholiaQ127736123MaRDI QIDQ2421566
Nicole Berline, Matthias Köppe, M. Welleda Baldoni Silva, Michèle Vergne, Jesús A. De Loera
Publication date: 17 June 2019
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.8632
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
Cites Work
- Rational Ehrhart quasi-polynomials
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Integer points in polyhedra
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Multidimensional Ehrhart reciprocity
- Representations of polytopes and polyhedral sets
- INTERMEDIATE SUMS ON POLYHEDRA II: BIDEGREE AND POISSON FORMULA
- Analytic Combinatorics in Several Variables
- How to integrate a polynomial over a simplex
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- Linear Decision Trees, Subspace Arrangements, and Mobius Functions
- 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
- Analytic continuation of a parametric polytope and wall-crossing
- Computing the Ehrhart quasi-polynomial of a rational simplex
