Tropical Convex Hull Computations
From MaRDI portal
\texttt{polymake}convex hull algorithmsmax-plus convexitytropical convexitytropical determinantstropical Grassmanianstropical hyperplanestropical polytopes
Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Real algebraic and real-analytic geometry (14P99) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Combinatorial complexity of geometric structures (52C45)
Abstract: This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial ideals, subdivisions of products of simplices, matroid theory, finite metric spaces, and the tropical Grassmannians. The relationship between these topics is explained via one running example throughout the whole paper. The final section explains how the new version 2.9.4 of the software system polymake can be used to compute with tropical polytopes.
Recommendations
Cited in
(24)- On integer images of max-plus linear mappings
- Tropical convexity
- Computing the vertices of tropical polyhedra using directed hypergraphs
- Algorithms for tight spans and tropical linear spaces
- Max-plus convexity in Archimedean Riesz spaces
- Tropical Ehrhart theory and tropical volume
- Polytropes and tropical eigenspaces: cones of linearity
- Computing convex hulls and counting integer points with \texttt{polymake}
- Tropicalization of facets of polytopes
- a-tint: a polymake extension for algorithmic tropical intersection theory
- Computing tropical varieties
- Tropical convexity via cellular resolutions
- On tropical supereigenvectors
- The tropical double description method
- scientific article; zbMATH DE number 5722807 (Why is no real title available?)
- Tropical computations in \texttt{polymake}
- On Affine Tropical F5 Algorithms
- What Tropical Geometry Tells Us about the Complexity of Linear Programming
- Combinatorics of tropical polytopes
- Tropical halfspaces
- A tropical view on Bruhat-Tits buildings and their compactifications.
- Tropical polar cones, hypergraph transversals, and mean payoff games
- Minimal half-spaces and external representation of tropical polyhedra
- Tropical compactification via Ganter's algorithm
This page was built for publication: Tropical Convex Hull Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181765)
