Polytope volume in Normaliz

DOI10.1007/S40863-022-00317-9MaRDI QIDQ6116629zbMATH OpenOpenAlexWikidataFDO

Authors Winfried Bruns

Publication date 18 July 2023

Published in São Paulo Journal of Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Lawrence algorithmpolytopevolume

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: We survey the computation of polytope volumes by the algorithms of Normaliz to which the Lawrence algorithm has recently been added. It has enabled us to master volume computations for polytopes from social choice in dimension $119$. This challenge required a sophisticated implementation of the Lawrence algorithm.

Cites work

• Automorphism groups and normal forms in Normaliz
• Computations of volumes and Ehrhart series in four candidates elections
• Cyclotomic polytopes and growth series of cyclotomic lattices
• Elections, voting rules and paradoxical outcomes
• Exploiting polyhedral symmetries in social choice
• Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
• scientific article; zbMATH DE number 1538124 (Why is no real title available?)
• scientific article; zbMATH DE number 2084924 (Why is no real title available?)
• Monomial algebras
• On Ehrhart polynomials and probability calculations in voting theory
• Polytope volume by descent in the face lattice and applications in social choice
• Polytope Volume Computation
• Polytopes, Rings, and K-Theory
• Practical graph isomorphism. II.
• The computation of generalized Ehrhart series in normaliz
• The Ehrhart polynomial of the Birkhoff polytope
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The power of pyramid decomposition in Normaliz
• The volume of duals and sections of polytopes
• Voting paradoxes and group coherence. The Condorcet efficiency of voting rules.

Cited in

(3)

• Linear programming with infinite, finite, and infinitesimal values in the right-hand side
• Ehrhart bounds for panhandle and paving matroids through enumeration of chain forests
• Polytope volume by descent in the face lattice and applications in social choice

This page was built for publication: Polytope volume in Normaliz

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