The computation of generalized Ehrhart series in normaliz

DOI10.1016/J.JSC.2014.09.004MaRDI QIDQ480673zbMATH OpenOpenAlexFDO

Authors Winfried Bruns, Christof Söger

Publication date 9 December 2014

Published in Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

rational polytopegeneralized Ehrhart seriesnormaliz

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Voting theory (91B12)

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.

Recommendations

• Computations of volumes and Ehrhart series in four candidates elections
• On Ehrhart polynomials and probability calculations in voting theory
• Computing the Ehrhart quasi-polynomial of a rational simplex
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 1194481 (Why is no real title available?)
• scientific article; zbMATH DE number 1231230 (Why is no real title available?)
• CoCoALib: A C++ library for computations in commutative algebra\(\dots \) and beyond
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• Computing parametric rational generating functions with a primal Barvinok algorithm
• Computing the Continuous Discretely
• Exploiting polyhedral symmetries in social choice
• How to integrate a polynomial over a simplex
• Linear Diophantine equations and local cohomology
• Normaliz: Algorithms for affine monoids and rational cones
• On Ehrhart polynomials and probability calculations in voting theory
• Polytopes, Rings, and K-Theory
• Probability calculations under the IAC hypothesis
• The power of pyramid decomposition in Normaliz

Cited in

(19)

• Polytope volume by descent in the face lattice and applications in social choice
• Exploiting symmetries in polyhedral computations
• Computations of volumes and Ehrhart series in four candidates elections
• Polytope volume in Normaliz
• Probabilities of electoral outcomes: from three-candidate to four-candidate elections
• When ties are possible: weak Condorcet winners and Arrovian rationality
• On the score sheets of a round-robin football tournament
• On Ehrhart polynomials and probability calculations in voting theory
• Majority properties of positional social preference correspondences
• The power of pyramid decomposition in Normaliz
• Weighted Ehrhart theory: extending Stanley's nonnegativity theorem
• Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox
• Exploring the No-Show Paradox for Condorcet Extensions
• IAC Probability Calculations in Voting Theory: Progress Report
• Existence of unimodular triangulations -- positive results
• Normalizing notations in the Ershov hierarchy
• Computing Galois groups of Ehrhart polynomials in OSCAR
• Normaliz 2013--2016
• On the Condorcet efficiency of evaluative voting (and other voting rules) with trichotomous preferences

Describes a project that uses

Uses Software

• LattE
• Normaliz
• CoCoALib

This page was built for publication: The computation of generalized Ehrhart series in normaliz

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480673)