The Minkowski Theorem for Max-plus Convex Sets
Stephane Gaubert, Ricardo Katz
Abstract
We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of (R\-∞\)n can be written as the max-plus convex combination of at most n+1 of the extreme points of this subset. We establish related results for closed max-plus convex cones and closed unbounded max-plus convex sets. In particular, we show that a closed max-plus convex set can be decomposed as a max-plus sum of its recession cone and of the max-plus convex hull of its extreme points.
Create a lesson
Related papers
Approximate Gromov--Hausdorff continuity of magnitude and weighting
Masahiko Yoshinaga
Improvement of the dimension bound for unweighted RCD spaces
Camillo Brena, Luca Gennaioli
Continuity of the magnitude for finite metric spaces with nonnegative weightings
Yuki Hiyoshi
On low-dimensional uniform rectifiability in Heisenberg groups - Part 2
Yibo Chen, Katrin Fässler, Kilian Zambanini
Equilibrium Laws for Julia's Zero and the Hyperbolic Zero of Binary Forms
Artur Elezi
Sylvester's four point problem for ball-convex bodies
Alexandra Bakó-Szabó, Florian Besau, Ferenc Fodor