Computing the Volume of Polytropes
Killian Hong-Minh, Paul Sheehan

TL;DR
This paper introduces an efficient algorithm for computing the volume of polytropes by leveraging a tropical Cramer's rule, simplifying the process and reducing computational complexity.
Contribution
It presents a novel application of tropical linear algebra to improve volume computation of polytropes, with a streamlined algorithm and reduced time complexity.
Findings
Successfully computed polytrope volumes using the new method
Reduced algorithm complexity compared to previous approaches
Demonstrated efficiency improvements in volume calculations
Abstract
We apply an algorithm for measuring the volume of polytopes described by Jim Lawrence to polytropes. By using a tropical form of Cramer's rule, we found an efficient way to find all pseudovertices which are necessary for computing the volume. Due to the limited possibilities for hyperplanes of polytropes, this led to a simplification of the algorithm, decreasing the time complexity significantly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
