Diameter, Decomposability, and Minkowski Sums of Polytopes

DOI10.4153/S0008439518000668zbMath1429.52014arXiv1806.07643MaRDI QIDQ5242542

Lionel Pournin, Antoine Deza

Publication date: 12 November 2019

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.07643

zbMATH Keywords

diameterMinkowski sumpolytope decomposability

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Distance in graphs (05C12)

Related Items (6)

A linear optimization oracle for zonotope computation ⋮ Between graphical zonotope and graph-associahedron ⋮ The diameter of lattice zonotopes ⋮ On Dantzig figures from graded lexicographic orders ⋮ Computational determination of the largest lattice polytope diameter ⋮ The vertices of primitive zonotopes

Cites Work

• A counterexample to the Hirsch conjecture
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
• Primitive zonotopes
• Indecomposable polytopes
• Improved bounds on the diameter of lattice polytopes
• \(f\)-vectors of Minkowski additions of convex polytopes
• Decomposability of polytopes
• Lectures on Polytopes
• Convex Polytopes
• Indecomposable Polytopes
• Decomposable convex polyhedra

This page was built for publication: Diameter, Decomposability, and Minkowski Sums of Polytopes