Author:
Deza Antoine,Pournin Lionel
Abstract
AbstractWe investigate how the Minkowski sum of two polytopes affects their graph and, in particular, their diameter. We show that the diameter of the Minkowski sum is bounded below by the diameter of each summand and above by, roughly, the product between the diameter of one summand and the number of vertices of the other. We also prove that both bounds are sharp. In addition, we obtain a result on polytope decomposability. More precisely, given two polytopes $P$ and $Q$, we show that $P$ can be written as a Minkowski sum with a summand homothetic to $Q$ if and only if $P$ has the same number of vertices as its Minkowski sum with $Q$.
Publisher
Canadian Mathematical Society
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Between graphical zonotope and graph-associahedron;Turkish Journal of Mathematics;2023-01-01
2. A linear optimization oracle for zonotope computation;Computational Geometry;2022-01
3. The diameter of lattice zonotopes;Proceedings of the American Mathematical Society;2020-03-30