The computation of generalized Ehrhart series in Normaliz
Winfried Bruns, Christof S\"oger
TL;DR
This paper presents an algorithm for computing generalized Ehrhart series using Stanley decompositions, implemented in Normaliz, with applications demonstrated through examples in combinatorial voting theory.
Contribution
It introduces a novel algorithm for weighted Ehrhart series computation based on Stanley decompositions, implemented in Normaliz.
Findings
Algorithm successfully computes generalized Ehrhart series.
Implementation in Normaliz enhances computational efficiency.
Applications demonstrated in combinatorial voting theory.
Abstract
We describe an algorithm for the computation of generalized (or weighted) Ehrhart series based on Stanley decompositions as implemented in the offspring NmzIntegrate of Normaliz. The algorithmic approach includes elementary proofs of the basic results. we illustrate the computations by examples from combinatorial voting theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.