The computation of generalized Ehrhart series in normaliz

DOI10.1016/J.JSC.2014.09.004zbMATH Open1320.52018arXiv1211.5178OpenAlexW1981354802MaRDI QIDQ480673FDOQ480673

Christof Söger, Winfried Bruns

Publication date: 9 December 2014

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

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.

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

Recommendations

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

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)

Cites Work

• CoCoALib: A C++ Library for Computations in Commutative Algebra... and Beyond
• Software for exact integration of polynomials over polyhedra
• Computing the Continuous Discretely
• Polytopes, Rings, and K-Theory
• Normaliz: Algorithms for affine monoids and rational cones
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Ehrhart polynomials and probability calculations in voting theory
• Probability calculations under the IAC hypothesis
• Title not available (Why is that?)
• Linear Diophantine equations and local cohomology
• How to integrate a polynomial over a simplex
• Computing parametric rational generating functions with a primal Barvinok algorithm
• Exploiting polyhedral symmetries in social choice
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• The power of pyramid decomposition in Normaliz

Cited In (18)

• Polytope volume by descent in the face lattice and applications in social choice
• Computations of volumes and Ehrhart series in four candidates elections
• Polytope volume in Normaliz
• Existence of unimodular triangulations — positive results
• Exploiting Symmetries in Polyhedral Computations
• 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
• Normaliz 2013–2016
• Majority properties of positional social preference correspondences
• Weighted Ehrhart theory: extending Stanley's nonnegativity theorem
• The power of pyramid decomposition in Normaliz
• 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
• Normalizing notations in the Ershov hierarchy
• Computing Galois groups of Ehrhart polynomials in OSCAR
• On the Condorcet efficiency of evaluative voting (and other voting rules) with trichotomous preferences

Uses Software

• CoCoALib
• Normaliz
• LattE

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)