Algorithms for Tight Spans and Tropical Linear Spaces

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.

14 pages, 3 figures, 1 table added a computational result (Proposition 5.5) about the difference of the Dressian $Dr(3,8)$ and the tropical Grassmanians $G{r}_p(3,8)$, as well as minor edits, corrections and additions

References in corpus (2)

• Matroid polytopes, nested sets and Bergman fans
• Representing tropical linear spaces by circuits

Cited by in corpus (5)

• The Schläfli Fan
• Parallel Computation of tropical varieties, their positive part, and tropical Grassmannians
• Real tropical hyperfaces by patchworking in $\text{polymake}$
• A new face iterator for polyhedra and more general finite locally branched lattices
• Moduli spaces of codimension-one subspaces in a linear variety and their tropicalization