Abstract
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 simplicial. This remarkably simple result derives from insights about rainbow point configurations and the work of McMullen.
Original language | English |
---|---|
Article number | 59 |
Number of pages | 12 |
Journal | Séminaire Lotharingien de Combinatoire |
Volume | 85B |
Publication status | Published - 2021 |
Event | 33rd Conference on Formal Power Series and Algebraic Combinatorics: FPSAC 2021 - Virtuell, Israel Duration: 17 Jan 2022 → 20 Jan 2022 |