The width of five-dimensional prismatoids

DOI10.1112/plms/pdu064zbMath1330.52015arXiv1202.4701OpenAlexW3102921527MaRDI QIDQ5245200

Benjamin Matschke, Christophe Weibel, Francisco Santos

Publication date: 2 April 2015

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial diameterHirsch conjectureprismatoid\(5\)-dimensional prismatoids\(d\)-dimensional convex polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Linear programming (90C05)

Related Items

Diameters of cocircuit graphs of oriented matroids: an update, Improving bounds on the diameter of a polyhedron in high dimensions, Obstructions to weak decomposability for simplicial polytopes, Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable, Hirsch polytopes with exponentially long combinatorial segments, Topological Prismatoids and Small Simplicial Spheres of Large Diameter, Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids, A counterexample to the Hirsch conjecture, A Friendly Smoothed Analysis of the Simplex Method, Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count, On the circuit diameter conjecture, A formalization of convex polyhedra based on the simplex method, On the shadow simplex method for curved polyhedra, An asymptotically improved upper bound on the diameter of polyhedra

Cites Work

• Unnamed Item
• Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
• A counterexample to the Hirsch conjecture
• An update on the Hirsch conjecture
• Triangulations. Structures for algorithms and applications
• An upper bound for the diameter of a polytope
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• The d-Step Conjecture and Its Relatives
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• Paths on Polytopes