Algorithms for Tight Spans and Tropical Linear Spaces
Simon Hampe, Michael Joswig, Benjamin Schr\"oter

TL;DR
This paper introduces a novel algorithmic approach for efficiently computing tropical linear spaces and their duals, leveraging Ganter's closure system algorithm to improve computational methods in tropical geometry.
Contribution
The paper presents a new method based on Ganter's algorithm for computing tropical linear spaces and duals of polyhedral subdivisions, advancing computational techniques in tropical geometry.
Findings
Efficient computation of tropical linear spaces.
Application of Ganter's algorithm to tropical geometry.
Enhanced methods for dual polyhedral subdivisions.
Abstract
We describe a new method for computing tropical linear spaces and more general duals of polyhedral subdivisions. It is based on Ganter's algorithm (1984) for finite closure systems.
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 · Constraint Satisfaction and Optimization · Advanced Optimization Algorithms Research
