The computation of generalized Ehrhart series in normaliz

DOI10.1016/j.jsc.2014.09.004zbMath1320.52018arXiv1211.5178OpenAlexW1981354802MaRDI QIDQ480673

Christof Söger, Winfried Bruns

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

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

Related Items

Polytope volume by descent in the face lattice and applications in social choice, 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, Normaliz 2013–2016, On the Condorcet efficiency of evaluative voting (and other voting rules) with trichotomous preferences, On the score sheets of a round-robin football tournament, Computing Galois groups of Ehrhart polynomials in OSCAR, Polytope volume in Normaliz, The power of pyramid decomposition in Normaliz, When ties are possible: weak Condorcet winners and Arrovian rationality, Computations of volumes and Ehrhart series in four candidates elections, Existence of unimodular triangulations — positive results, Probabilities of electoral outcomes: from three-candidate to four-candidate elections, Exploiting Symmetries in Polyhedral Computations, Majority properties of positional social preference correspondences

Uses Software

• CoCoALib
• Normaliz
• LattE

Cites Work

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