Polytope volume in Normaliz

DOI10.1007/s40863-022-00317-9arXiv2112.09518OpenAlexW4287578809WikidataQ121476582 ScholiaQ121476582MaRDI QIDQ6116629

Winfried Bruns

Publication date: 18 July 2023

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

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

zbMATH Keywords

volumepolytopeLawrence algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The computation of generalized Ehrhart series in normaliz
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Voting paradoxes and group coherence. The Condorcet efficiency of voting rules.
• Polytope volume by descent in the face lattice and applications in social choice
• The power of pyramid decomposition in Normaliz
• Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
• The Ehrhart polynomial of the Birkhoff polytope
• Automorphism groups and normal forms in Normaliz
• Computations of volumes and Ehrhart series in four candidates elections
• Elections, voting rules and paradoxical outcomes
• On Ehrhart polynomials and probability calculations in voting theory
• Practical graph isomorphism. II.
• Exploiting polyhedral symmetries in social choice
• Cyclotomic polytopes and growth series of cyclotomic lattices
• Non-very ample configurations arising from contingency tables
• Polytope Volume Computation
• Polytopes, Rings, and K-Theory
• The volume of duals and sections of polytopes
• Monomial Algebras