Weighted digraphs and tropical cones

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 ${\mathbb{R}}^d$. This leads to natural cell decompositions of the tropical projective space ${\mathbb{TP}}_{\min }^{d-1}$. 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).

40 pages, 16 figures. Final version, journal information

References in corpus (1)

• Duality and separation theorems in idempotent semimodules

Cited by in corpus (13)

• Fundamental polytopes of metric trees via parallel connections of matroids
• Tropical Geometry and Mechanism Design
• Presentations of Transversal Valuated Matroids
• Two-player incentive compatible outcome functions are affine maximizers
• A tropical isoperimetric inequality
• Matching fields and lattice points of simplices
• Tropical bisectors and Voronoi diagrams
• Tropical Gaussians: A Brief Survey
• The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
• Linear and Rational Factorization of Tropical Polynomials
• Convergent Hahn Series and Tropical Geometry of Higher Rank
• Tropical convex hulls of polyhedral sets
• Tropical combinatorics of max-linear Bayesian networks