A continuous \(d\)-step conjecture for polytopes (Q1017920)

Let a \(d\)-dimensional polytope \(P\) be defined as the intersection of \(n\) half-spaces. The \textit{diameter} \(\delta\) of \(P\) is the smallest number such that any two vertices of \(P\) can be connected by a path consisting of at most \(\delta\) edges. The \textit{Hirsch conjecture} suggests that the diameter of \(P\) is at most \(n-d\). The authors study a continuous analogue of the diameter, namely, the \textit{curvature} of \(P\), defined as the largest possible total curvature of the associated central path. They prove that if the order of the curvature is less than \(d\) for all polytopes defined by \(2d\) inequalities and for all \(d\), then the order of the curvature of a \(d\)-dimensional polytope is less than \(n\), the number of defining half-spaces. This result can be viewed as the continuous analogue of a theorem of Klee and Walkup, who showed that the general case of the Hirsch conjecture is equivalent to the special case of a \(d\)-dimensional polytope defined by \(2d\) half-spaces.