More bounds on the diameters of convex polytopes
David Bremner, Antoine Deza, William Hua, and Lars Schewe

TL;DR
This paper investigates the maximum edge diameter of convex polytopes, providing new bounds and exact values that challenge existing conjectures, especially showing the Hirsch bound is not always tight in dimension 4.
Contribution
The authors establish the exact value of (4,12)=7 and provide evidence that (5,12)=(6,13)=7, advancing understanding of polytope diameters and the Hirsch conjecture.
Findings
(4,12)=7
(5,12)=7
(6,13)=7
Abstract
Finding a good bound on the maximal edge diameter of a polytope in terms of its dimension and the number of its facets is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known, the behaviour of the function is largely unknown. The Hirsch conjecture, formulated in 1957 and reported in \cite{GD}, states that is linear in and : . The conjecture is known to hold in small dimensions, i.e., for \cite{VK}, along with other specific pairs of and (Table \ref{before}). However, the asymptotic behaviour of is not well understood: the best upper bound -- due to Kalai and Kleitman -- is quasi-polynomial \cite{GKDK}. In this article we will show that and present strong evidence for . The first of these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Computational Geometry and Mesh Generation · Advanced Graph Theory Research
