Abstract: This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be considered via coarsenings of the resulting polyhedral decompositions of . This leads to natural cell decompositions of the tropical projective space . Our method is to employ a known class of ordinary convex polyhedra naturally associated with weighted digraphs. This way we can relate to and use results from combinatorics and optimization. One outcome is the solution of a conjecture of Develin and Yu (2007).
Recommendations
Cites work
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- A Topological Representation Theorem for Tropical Oriented Matroids: Part I
- A strong-connectivity algorithm and its applications in data flow analysis
- Alcoved polytopes. I.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing the vertices of tropical polyhedra using directed hypergraphs
- Dressians, tropical Grassmannians, and their rays
- Duality and separation theorems in idempotent semimodules.
- Enumerating polytropes
- Faces of generalized permutohedra
- Generating all vertices of a polyhedron is hard
- Idempotent functional analysis: An algebraic approach
- Lectures on Polytopes
- Max-linear systems. Theory and algorithms.
- Maximum-Minimum Sätze über Graphen
- Minimal half-spaces and external representation of tropical polyhedra
- Splitting Polytopes
- Stiefel tropical linear spaces
- The tropical Grassmannian
- Triangulations. Structures for algorithms and applications
- Tropical Polytopes and Cellular Resolutions
- Tropical and ordinary convexity combined
- Tropical convexity
- Tropical geometry and its applications
- Tropical halfspaces
- Tropical hyperplane arrangements and oriented matroids
- Tropical polyhedra are equivalent to mean payoff games
- Tropicalization of facets of polytopes
- Tropicalizing the simplex algorithm
- Two poset polytopes
Cited in
(21)- Polypositroids
- Tropical bisectors and Voronoi diagrams
- Presentations of transversal valuated matroids
- A tropical isoperimetric inequality
- Tropical linear spaces and tropical convexity
- Monomial Tropical Cones for Multicriteria Optimization
- Face monoid actions and tropical hyperplane arrangements
- Abstract tropical linear programming
- Matching fields and lattice points of simplices
- Tropical Carathéodory with matroids
- Fundamental polytopes of metric trees via parallel connections of matroids
- The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
- \(K3\) polytopes and their quartic surfaces
- Polytropes and tropical eigenspaces: cones of linearity
- Convergent Hahn series and tropical geometry of higher rank
- Tropical Ehrhart theory and tropical volume
- Two-player incentive compatible outcome functions are affine maximizers
- Face posets of tropical polyhedra and monomial ideals
- Tropicalization of facets of polytopes
- Tropical Gaussians: a brief survey
- Tropical compactification via Ganter's algorithm
This page was built for publication: Weighted digraphs and tropical cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q273146)
