arXiv Analytics

Sign in

arXiv:2009.07252 [math.CO]AbstractReferencesReviewsResources

Minkowski summands of cubes

Federico Castillo, Joseph Doolittle, Bennet Goeckner, Michael S. Ross, Li Ying

Published 2020-09-15Version 1

In pioneering works of Meyer and of McMullen in the early 1970s, the set of Minkowski summands of a polytope was shown to be a polyhedral cone called the type cone. Explicit computations of type cones are in general intractable. Nevertheless, we show that the type cone of the product of simplices is the cone over a simplex. This remarkably simple result derives from insights about rainbow point configurations and the work of McMullen.

Comments: 14 pages, 6 figures. Comments welcome!
Categories: math.CO
Subjects: 52B05, 52B35
Related articles: Most relevant | Search more
arXiv:0912.2927 [math.CO] (Published 2009-12-15)
Another Proof of the Fact that Polyhedral Cones are Finitely Generated
arXiv:1205.6314 [math.CO] (Published 2012-05-29, updated 2013-02-13)
Minimal external representations of tropical polyhedra
arXiv:1207.0640 [math.CO] (Published 2012-07-03)
The Horn problem and planar networks