Discrete & Computational Geometry

, Volume 52, Issue 1, pp 102–115

# On Sub-determinants and the Diameter of Polyhedra

• Nicolas Bonifas
• Marco Di Summa
• Friedrich Eisenbrand
• Nicolai Hähnle
• Martin Niemeier
Article

## Abstract

We derive a new upper bound on the diameter of a polyhedron $$P = \{x {\in } {\mathbb {R}}^n :Ax\le b\}$$, where $$A \in {\mathbb {Z}}^{m\times n}$$. The bound is polynomial in $$n$$ and the largest absolute value of a sub-determinant of $$A$$, denoted by $$\Delta$$. More precisely, we show that the diameter of $$P$$ is bounded by $$O(\Delta ^2 n^4\log n\Delta )$$. If $$P$$ is bounded, then we show that the diameter of $$P$$ is at most $$O(\Delta ^2 n^{3.5}\log n\Delta )$$. For the special case in which $$A$$ is a totally unimodular matrix, the bounds are $$O(n^4\log n)$$ and $$O(n^{3.5}\log n)$$ respectively. This improves over the previous best bound of $$O(m^{16}n^3(\log mn)^3)$$ due to Dyer and Frieze (Math Program 64:1–16, 1994).

## Keywords

Diameter of polyhedra Polyhedral graph Total unimodularity

## 1 Introduction

One of the fundamental open problems in optimization and discrete geometry is the question whether the diameter of a polyhedron can be bounded by a polynomial in the dimension and the number of its defining inequalities.The problem is readily explained: A polyhedron is a set of the form $$P = \{x \in {\mathbb {R}}^n :Ax\le b\}$$, where $$A \in {\mathbb {R}}^{m\times n}$$ is a matrix and $$b \in {\mathbb {R}}^m$$ is an $$m$$-dimensional vector. A vertex of $$P$$ is a point $$x^* \in P$$ such that there exist $$n$$ linearly independent rows of $$A$$ whose corresponding inequalities of $$Ax\le b$$ are satisfied by $$x^*$$ with equality. Throughout this paper, we assume that the polyhedron $$P$$ is pointed, i.e. it has vertices, which is equivalent to saying that the matrix $$A$$ has full column-rank. Two different vertices $$x^*$$ and $$y^*$$ are neighbors if they are the endpoints of an edge of the polyhedron, i.e. there exist $$n-1$$ linearly independent rows of $$A$$ whose corresponding inequalities of $$Ax\le b$$ are satisfied with equality both by $$x^*$$ and $$y^*$$. In this way, we obtain the undirected polyhedral graph with edges being pairs of neighboring vertices of $$P$$. This graph is connected. The diameter of $$P$$ is the smallest natural number that bounds the length of a shortest path between any pair of vertices in this graph. The question is now as follows:

Can the diameter of a polyhedron $$P = \{x \in {\mathbb {R}}^n :Ax\le b\}$$ be bounded by a polynomial in $$m$$ and $$n$$?

The belief in a positive answer to this question is called the polynomial Hirsch conjecture. Despite a lot of research effort during the last 50 years, the gap between lower and upper bounds on the diameter remains huge. While, when the dimension $$n$$ is fixed, the diameter can be bounded by a linear function of $$m$$ [2, 16], for the general case the best upper bound, due to Kalai and Kleitman [13], is $$m^{1 + \log n}$$. The best lower bound is of the form $$(1+\varepsilon ) \cdot m$$ for some $$\varepsilon >0$$ in fixed and sufficiently large dimension $$n$$. This is due to a celebrated result of Santos [21] who disproved the, until then longstanding, original Hirsch conjecture for polytopes. The Hirsch conjecture stated that the diameter of a bounded polyhedron1 is at most $$m-n$$. Interestingly, this huge gap (polynomial versus quasi-polynomial) is also not closed in a very simple combinatorial abstraction of polyhedral graphs [8]. However, it was shown by Vershynin [22] that every polyhedron can be perturbed by a small random amount so that the expected diameter of the resulting polyhedron is bounded by a polynomial in $$n$$ and $$\ln m$$. See Kim and Santos [14] for a recent survey.

In light of the importance and apparent difficulty of the open question above, many researchers have shown that it can be answered in an affirmative way in some special cases. Naddef [19] proved that the Hirsch conjecture holds true for $$0/1$$-polytopes. Orlin [20] provided a quadratic upper bound for flow-polytopes. Brightwell et al. [5] showed that the diameter of the transportation polytope is linear in $$m$$ and $$n$$, and a similar result holds for the dual of a transportation polytope [1] and the axial $$3$$-way transportation polytope [7].

The results on flow polytopes and classical transportation polytopes concern polyhedra defined by totally unimodular matrices, i.e., integer matrices whose sub-determinants are $$0,\pm 1$$. For such polyhedra Dyer and Frieze [6] had previously shown that the diameter is bounded by a polynomial in $$n$$ and $$m$$. Their bound is $$O(m^{16}n^3(\log mn)^3)$$. Their result is also algorithmic: they show that there exists a randomized simplex-algorithm that solves linear programs defined by totally unimodular matrices in polynomial time.

Our main result is a generalization and considerable improvement of the diameter bound of Dyer and Frieze. We show that the diameter of a polyhedron $$P = \{x \in {\mathbb {R}}^n :Ax\le b\}$$, with $$A \in {\mathbb {Z}}^{m\times n}$$ is bounded by $$O(\Delta ^2 n^4\log n\Delta )$$. Here, $$\Delta$$ denotes the largest absolute value of a sub-determinant of $$A$$. If $$P$$ is bounded, i.e., a polytope, then we can show that the diameter of $$P$$ is at most $$O(\Delta ^2 n^{3.5}\log n\Delta )$$. To compare our bound with the one of Dyer and Frieze one has to set $$\Delta$$ above to one and obtains $$O(n^4\log n)$$ and $$O(n^{3.5}\log n)$$ respectively. Notice that our bound is independent of $$m$$, i.e., the number of rows of $$A$$.

### 1.1 The Proof Method

Let $$u$$ and $$v$$ be two vertices of $$P$$. We estimate the maximum number of iterations of two breadth-first-search explorations of the polyhedral graph, one initiated at $$u$$, the other initiated at $$v$$, until a common vertex is discovered. The diameter of $$P$$ is at most twice this number of iterations. The main idea in the analysis is to reason about the normal cones of vertices of $$P$$ and to exploit a certain volume expansion property.

We can assume that $$P = \{x \in {\mathbb {R}}^n :Ax\le b\}$$ is non-degenerate, i.e., each vertex has exactly $$n$$ tight inequalities. This can be achieved by slightly perturbing the right-hand side vector $$b$$: in this way the diameter can only grow. Notice that the polyhedron is then also full-dimensional. We denote the polyhedral graph of $$P$$ by $$G_P = (V,E)$$. Let $$v \in V$$ now be a vertex of $$P$$. The normal cone $$C_v$$ of $$v$$ is the set of all vectors $$c \in {\mathbb {R}}^n$$ such that $$v$$ is an optimal solution of the linear program $$\max \{c^Tx:x \in {\mathbb {R}}^n, \, Ax\le b\}$$. The normal cone $$C_v$$ of a vertex of $$v$$ is a full-dimensional simplicial polyhedral cone. Two vertices $$v$$ and $$v'$$ are adjacent if and only if $$C_v$$ and $$C_{v'}$$ share a facet. No two distinct normal cones share an interior point. Furthermore, if $$P$$ is a polytope, then the union of the normal cones of vertices of $$P$$ is the complete space $${\mathbb {R}}^n$$.

We now define the volume of a set $$U\subseteq V$$ of vertices as the volume of the union of the normal cones of $$U$$ intersected with the unit ball $$B_n = \{ x \in {\mathbb {R}}^n :\Vert x\Vert _2\le 1\}$$, i.e.,
\begin{aligned} {\mathrm {vol}}(U) := {\mathrm {vol}}\big ( \bigcup _{v \in U} C_v \cap B_n \big ). \end{aligned}
Consider an iteration of breadth-first-search. Let $$I\subseteq V$$ be the set of vertices that have been discovered so far. Breadth-first-search will next discover the neighborhood of $$I$$, which we denote by $$\mathcal {N}(I)$$.

Together with the integrality of $$A$$, the bound $$\Delta$$ on the subdeterminants guarantees that the angle between one facet of a normal cone $$C_v$$ and the opposite ray is not too small. We combine this fact, which we formalize in Lemma 3, with an isoperimetric inequality to show that the volume of $$\mathcal {N}(I)$$ is large relative to the volume of $$I$$.

### Lemma 1

Let $$P=\{x \in {\mathbb {R}}^n :Ax\le b\}$$ be a polytope where all sub-determinants of $$A\in {\mathbb {Z}}^{m\times n}$$ are bounded by $$\Delta$$ in absolute value and let $$I\subseteq V$$ be a set of vertices of $$G_P$$ with $${\mathrm {vol}}(I) \le (1/2) \cdot {\mathrm {vol}}(B_n)$$. Then the volume of the neighborhood of $$I$$ is at least
\begin{aligned} {\mathrm {vol}}({\mathcal {N}(I)})\ge \sqrt{\frac{2}{\pi }}\frac{1}{\Delta ^2 n^{2.5}}\cdot {\mathrm {vol}}(I). \end{aligned}

We provide the proof of this lemma in the next section. Our diameter bound for polytopes is an easy consequence:

### Theorem 2

Let $$P=\{x \in {\mathbb {R}}^n :Ax\le b\}$$ be a polytope where all subdeterminants of $$A\in {\mathbb {Z}}^{m\times n}$$ are bounded by $$\Delta$$ in absolute value. The diameter of $$P$$ is bounded by $$O(\Delta ^2 n^{3.5}\log n\Delta )$$.

### Proof

We estimate the maximum number of iterations of breadth-first-search until the total volume of the discovered vertices exceeds $$(1/2) \cdot {\mathrm {vol}}(B_n)$$. This is an upper bound on the aforementioned maximum number of iterations of two breadth-first-search explorations until a common vertex is discovered.

Suppose we start at vertex $$v$$ and let $$I_j$$ be the vertices that have been discovered during the first $$j$$ iterations. We have $$I_0 = \{v\}$$. If $$j\ge 1$$ and $${\mathrm {vol}}(I_{j-1}) \le (1/2) \cdot {\mathrm {vol}}(B_n)$$ we have by Lemma 1
\begin{aligned} {\mathrm {vol}}(I_{j})&\ge \bigg (1+ \sqrt{\frac{2}{\pi }}\frac{1}{\Delta ^2 n^{2.5}}\bigg ) {\mathrm {vol}}(I_{j-1}) \\&\ge \bigg (1+ \sqrt{\frac{2}{\pi }}\frac{1}{\Delta ^2 n^{2.5}}\bigg )^{j} {\mathrm {vol}}(I_0). \end{aligned}
The condition $${\mathrm {vol}}(I_j) \le (1/2) \cdot {\mathrm {vol}}(B_n)$$ implies
\begin{aligned} \bigg (1+ \frac{1}{ \sqrt{\frac{\pi }{2}} \Delta ^2 n^{2.5}}\bigg )^{j} {\mathrm {vol}}(I_0) \le 2^n. \end{aligned}
This is equivalent to
\begin{aligned} j \cdot \ln \bigg (1+ \frac{1}{ \sqrt{\frac{\pi }{2}} \Delta ^2 n^{2.5}}\bigg ) \le \ln (2^n / {\mathrm {vol}}(I_0)). \end{aligned}
For $$0 \le x \le 1$$ one has $$\ln (1 + x)\ge x/2$$ and thus the inequality above implies
\begin{aligned} j \le \sqrt{2 \pi } \Delta ^2 n^{2.5}\cdot \ln (2^n / {\mathrm {vol}}(I_0)). \end{aligned}
(1)
To finish the proof we need a lower bound on $${\mathrm {vol}}(I_0)$$, i.e., the $$n$$-dimensional volume of the set $$C_v\cap B_n$$. The normal cone $$C_v$$ contains the full-dimensional simplex spanned by $$0$$ and the $$n$$ row-vectors $$a_{i_1},\ldots ,a_{i_n}$$ of $$A$$ that correspond to the inequalities of $$Ax\le b$$ that are tight at $$v$$. Since $$A$$ is integral, the volume of this simplex is at least $$1/n!$$. Furthermore, if this simplex is scaled by $$1 / \max \{ \Vert a_{i_k}\Vert :k=1,\ldots ,n\}$$, then it is contained in the unit ball. Since each component of $$A$$ is itself a sub-determinant, one has $$\max \{\Vert a_{i_k}\Vert :k=1,\ldots ,n\} \le \sqrt{n} \Delta$$ and thus $${\mathrm {vol}}(I_0) \ge 1/ (n! \cdot n^{n/2} \Delta ^n)$$. It follows that (1) implies $$j = O(\Delta ^2 n^{3.5}\log n\Delta )$$. $$\square$$

### Remark

The result of Dyer and Frieze [6] is also based on analyzing expansion properties via isoperimetric inequalities. It is our choice of normal cones as the natural geometric representation, and the fact that we only ask for volume expansion instead of expansion of the graph itself, that allows us to get a better bound. Expansion properties of the graphs of general classes of polytopes have also been studied elsewhere in the literature, e.g. [11, 12].

### 1.2 Organization of the Paper

The next section is devoted to a proof of the volume-expansion property, i.e., Lemma 1. The main tool that is used here is a classical isoperimetric inequality that states that among measurable subsets of a sphere with fixed volume, spherical caps have the smallest circumference. Section 3 deals with unbounded polyhedra. Compared to the case of polytopes, the problem that arises here is the fact that the union of the normal cones is not the complete space $${\mathbb {R}}^n$$. To tackle this case, we rely on an isoperimetric inequality of Lovász and Simonovits [17]. Finally, we discuss how our bound can be further generalized. In fact, not all sub-determinants of $$A$$ need to be at most $$\Delta$$ but merely the entries of $$A$$ and the $$(n-1)$$-dimensional sub-determinants have to be bounded by $$\Delta$$, which yields a slightly stronger result.

## 2 Volume Expansion

This section is devoted to a proof of Lemma 1. Throughout this section, we assume that $$P = \{ x \in {\mathbb {R}}^n :Ax\le b\}$$ is a polytope. We begin with some useful notation. A (not necessarily convex) cone is a subset of $${\mathbb {R}}^n$$ that is closed under the multiplication with non-negative scalars. The intersection of a cone with the unit ball $$B_n$$ is called a spherical cone. Recall that $$C_v$$ denotes the normal cone of the vertex $$v$$ of $$P$$. We denote the spherical cone $$C_v \cap B_n$$ by $$S_v$$ and, for a subset $$U\subseteq V$$, the spherical cone $$\bigcup _{v \in U} S_v$$ by $$S_U$$. Our goal is to show that the following inequality holds for each $$I\subseteq V$$ with $${\mathrm {vol}}(S_I) \le \frac{1}{2} {\mathrm {vol}}(B_n)$$:
\begin{aligned} {\mathrm {vol}}(S_{\mathcal {N}(I)}) \ge \sqrt{\frac{2}{\pi }} \frac{1}{\Delta ^2 n^{2.5}} \cdot {\mathrm {vol}}(S_I). \end{aligned}
(2)
Recall that two vertices are adjacent in $$G_P$$ if and only if their normal cones have a common facet. This means that the neighbors of $$I$$ are those vertices $$u$$ for which $$S_u$$ has a facet which is part of the surface of the spherical cone $$S_I$$. In an iteration of breadth-first-search we thus augment the set of discovered vertices $$I$$ by those vertices $$u$$ that can “dock” on $$S_I$$ via a common facet. We call the $$(n-1)$$-dimensional volume of the surface of a spherical cone $$S$$ that is not on the sphere, the dockable surface $$D(S)$$, see Fig. 1.

The base of $$S$$ is the intersection of $$S$$ with the unit sphere. We denote the area of the base by $$B(S)$$. By area we mean the $$(n-1)$$-dimensional measure of some surface. Furthermore, $$L(S)$$ denotes the length of the relative boundary of the base of $$S$$. We use the term length to denote the measure of an $$(n-2)$$-dimensional volume, see Fig. 1.

Given any spherical cone $$S$$ in the unit ball, the following well-known relations follow from basic integration:
\begin{aligned} {\mathrm {vol}}(S)=\frac{B(S)}{n}, \quad D(S)=\frac{L(S)}{n-1}. \end{aligned}
(3)
To obtain the volume expansion relation (2) we need to bound the dockable surface of a spherical cone from below by its volume and, for a simplicial spherical cone, we need an upper bound on the dockable surface by its volume. More precisely, we show that for every simplicial spherical cone $$S_v$$ one has
\begin{aligned} \frac{D(S_v)}{{\mathrm {vol}}(S_v)} \le \Delta ^2 n^3 \end{aligned}
(4)
and for any spherical cone one has
\begin{aligned} \frac{D(S)}{{\mathrm {vol}}(S)} \ge \sqrt{\frac{2n}{\pi }}. \end{aligned}
(5)
Once inequalities (4) and (5) are derived, the bound (2) can be obtained as follows. All of the dockable surface of $$S_I$$ must be “consumed” by the neighbors of $$I$$. Using (5) one has thus
\begin{aligned} \sum _{v \in \mathcal {N}(I)} D(S_v) \ge D(S_I) \ge \sqrt{\frac{2n}{\pi }} \cdot {\mathrm {vol}}(S_I). \end{aligned}
(6)
On the other hand, (4) implies
\begin{aligned} \sum _{v \in \mathcal {N}(I)}D(S_v) \le \Delta ^2 n^3 \cdot \sum _{v \in \mathcal {N}(I)} {\mathrm {vol}}(S_v) = \Delta ^2 n^3 \cdot {\mathrm {vol}}(S_{{\mathcal {N}}(I)}). \end{aligned}
(7)
These last two inequalities imply inequality (2). The remainder of this section is devoted to proving (4) and (5).

### 2.1 Area to Volume Ratio of a Spherical Simplicial Cone

We will first derive inequality (4).

### Lemma 3

Let $$v$$ be a vertex of $$P$$. One has
\begin{aligned} \frac{D(S_v)}{{\mathrm {vol}}(S_v)} \le \Delta ^2 n^3. \end{aligned}

### Proof

Let $$F$$ be a facet of a spherical cone $$S_v$$. Let $$y$$ be the vertex of $$S_v$$ not contained in $$F$$. Let $$Q$$ denote the convex hull of $$F$$ and $$y$$ (see Fig. 2). We have $$Q\subseteq S_v$$ because $$S_v$$ is convex. Moreover, if $$h_F$$ is the Euclidean distance of $$y$$ from the hyperplane containing $$F$$, then
\begin{aligned} {\mathrm {vol}}(S_v) \ge {\mathrm {vol}}(Q) = \frac{\mathrm{area }(F)\cdot h_F}{n}. \end{aligned}
Summing over the facets of $$S_v$$, we find
\begin{aligned} \frac{D(S_v)}{{\mathrm {vol}}(S_v)} = \sum _{\text {facet } F} \frac{\mathrm{area }(F)}{{\mathrm {vol}}(S_v)} \le n \cdot \sum _{\text {facet } F} \frac{1}{h_F}. \end{aligned}
(8)
It remains to provide a lower bound on $$h_F$$. Let $$a_1, \ldots , a_n$$ be the row-vectors of $$A$$ defining the extreme rays of the normal cone of $$v$$, and let $$A_v$$ be the non-singular matrix whose rows are $$a_1, \ldots , a_n$$. Furthermore, suppose that the vertex $$y$$ lies on the ray generated by $$a_1$$. Let $$H$$ be the hyperplane generated by $$a_2,\ldots ,a_n$$. The distance $$d(y,H)$$ of $$y$$ to $$H$$ is equal to $$d(a_1,H) / \Vert a_1\Vert$$. Let $$b_1,\ldots ,b_n$$ be the columns of the adjugate of $$A_v$$. The column-vector $$b_1$$ is integral and each component of $$b_1$$ is bounded by $$\Delta$$. Furthermore $$b_1$$ is orthogonal to each of $$a_2,\ldots ,a_n$$. Thus $$d(a_1,H)$$ is the length of the projection of $$a_1$$ to $$b_1$$, which is $$|\langle a_1,b_1\rangle | / \Vert b_1\Vert \ge 1/(\sqrt{n} \cdot \Delta )$$, since $$a_1$$ and $$b_1$$ are integral. Thus
\begin{aligned} h_F=d(y,H) \ge \frac{1}{n \Delta ^2}. \end{aligned}
Plugging this into (8) completes the proof.$$\square$$

### 2.2 An Isoperimetric Inequality for Spherical Cones

We now derive the lower bound (5) on the area to volume ratio for a general spherical cone. To do that, we assume that the spherical cone has the least favorable shape for the area to volume ratio and derive the inequality for cones of this shape. Here one uses classical isoperimetric inequalities. The basic isoperimetric inequality states that the measurable subset of $${\mathbb {R}}^n$$ with a prescribed volume and minimal area is the ball of this volume. In this paper, we need Lévy’s isoperimetric inequality, see e.g. [10, Theorem 2.1], which can be seen as an analogous result for spheres: it states that a measurable subset of the sphere of prescribed area and minimal boundary is a spherical cap.

A spherical cone $$S$$ is a cone of revolution if there exist a vector $$v$$ and an angle $$0<\theta \le \pi /2$$ such that $$S$$ is the set of vectors in the unit ball that form an angle of at most $$\theta$$ with $$v$$:
\begin{aligned} S=\big \{x\in B_n:\frac{v^Tx}{\Vert v\Vert \Vert x\Vert }\ge \cos \theta \big \}. \end{aligned}
Note that a spherical cone is a cone of revolution if and only if its base is a spherical cap. We also observe that two spherical cones of revolution, defined by two different vectors but by the same angle, are always congruent. Therefore, in the following we will only specify the angle of a cone of revolution.

### Lemma 4

The spherical cone of given volume with minimum lateral surface is a cone of revolution.

### Proof

By the first equation of (3), every spherical cone of volume $$V$$ intersects the unit sphere in a surface of area $$nV$$. Furthermore, by the second equation of (3), the length of the boundary of this surface is proportional to the area of the lateral surface of the cone. Then the problem of finding the spherical cone of volume $$V$$ with the minimum lateral surface can be rephrased as follows: Find a surface of area $$nV$$ on the unit sphere having the boundary of minimum length. By Lévy’s isoperimetric inequality for spheres, the optimal shape for such a surface is a spherical cap. As observed above, this corresponds to a cone of revolution.$$\square$$

### Lemma 5

Let $$S$$ be a spherical cone of revolution of angle $$0<\theta \le \pi /2$$. Then
\begin{aligned} \frac{D(S)}{{\mathrm {vol}}(S)}\ge \sqrt{\frac{2n}{\pi }}. \end{aligned}

### Proof

Using (3), we have to show that
\begin{aligned} \frac{L(S)}{B(S)}\ge \sqrt{\frac{2}{\pi }}\frac{n-1}{\sqrt{n}}. \end{aligned}
(9)
This is done in two steps. We first prove that this ratio is minimal for $$S$$ being the half-ball, i.e., $$\theta = \pi /2$$. Then we show that $$\frac{L(S)}{B(S)}\ge \sqrt{\frac{2}{\pi }}\frac{n-1}{\sqrt{n}}$$ holds for the half-ball.

Let $$H$$ be the hyperplane containing the boundary of the base of $$S$$. Then $$H$$ divides $$S$$ into two parts: a truncated cone $$K$$ and the convex hull of a spherical cap. The radius $$r$$ of the base of $$K$$ is bounded by one.

Consider now the half-ball that contains $$B(S)$$ and that has $$H \cap B_n$$ as its flat-surface, see Fig. 3, and let $$\Sigma$$ denote the area of the corresponding half-sphere. One has $$B(S)\le \Sigma$$ and thus
\begin{aligned} \frac{L(S)}{B(S)} \ge \frac{L(S)}{\Sigma }. \end{aligned}
Now $$\Sigma$$ and $$L(S)$$ are the surface of an $$(n-1)$$-dimensional half-sphere of radius $$r$$ and the length of its boundary respectively. If we scale this half-sphere by a factor of $$1/r$$, we obtain the unit half-ball and its length respectively. Since scaling by a factor of $$1/r$$ increases areas by a factor of $$1/r^{n-1}$$ and lengths by a factor of $$1/r^{n-2}$$, we have that $$L(S)/{\Sigma }$$ is at least the length of the unit-half-ball divided by the area of the base of the half-ball.
Suppose now that $$S$$ is the half-unit-ball. We show that the inequality $$L(S)/B(S)\ge$$ $$\sqrt{\frac{2}{\pi }}\frac{n-1}{\sqrt{n}}$$ holds. The base of $$S$$ is a half unit sphere and $$L(S)$$ is the length of the boundary of a unit ball of dimension $$n-1$$. Thus
\begin{aligned}B(S)=\frac{n}{2}\frac{\pi ^{n/2}}{\Gamma \big (\frac{n}{2}+1\big )}, \quad L(S)=\frac{(n-1)\pi ^{(n-1)/2}}{\Gamma \big (\frac{n-1}{2}+1\big )},\end{aligned}
where $$\Gamma$$ is the well-known Gamma function. Using the fact that $$\Gamma (x+1/2)/\Gamma (x)\ge \sqrt{x-\frac{1}{4}}$$ for all $$x>\frac{1}{4}$$ (see, e.g., [18]), one easily verifies that
\begin{aligned} \Gamma \big (\frac{n}{2}+1\big )\ge \sqrt{\frac{n}{2}}\cdot \Gamma \left( \frac{n-1}{2}+1\right) . \end{aligned}
It follows that
\begin{aligned} \frac{L(S)}{B(S)}=\frac{2}{\sqrt{\pi }}\frac{n-1}{n}\frac{\Gamma \big (\frac{n}{2}+1\big )}{\Gamma \big (\frac{n-1}{2}+1\big )}\ge \sqrt{\frac{2}{\pi }}\cdot \frac{n-1}{\sqrt{n}}.\end{aligned}
$$\square$$

Finally we are now ready to consider the case of an arbitrary spherical cone.

### Lemma 6

Let $$S$$ be a (not necessarily convex) spherical cone with $${\mathrm {vol}}(S)\le \frac{1}{2} {\mathrm {vol}}(B_n)$$. Then
\begin{aligned} \frac{D(S)}{{\mathrm {vol}}(S)}\ge \sqrt{\frac{2n}{\pi }}. \end{aligned}

### Proof

Let $$S^*$$ be a spherical cone of revolution with the same volume as $$S$$. By Lemma 4, $$D(S)\ge D(S^*)$$. Now, using Lemma 5 one has
\begin{aligned} \frac{D(S)}{{\mathrm {vol}}(S)}\ge \frac{D(S^*)}{{\mathrm {vol}}(S^*)}\ge \sqrt{\frac{2n}{\pi }}. \end{aligned}
$$\square$$

This was the final step in the proof of Lemma 1 and thus we have also proved Theorem 2, our main result on polytopes. The next section is devoted to unbounded polyhedra.

## 3 The Case of an Unbounded Polyhedron

If the polyhedron $$P$$ is unbounded, then the union of the normal cones of all vertices of $$P$$ forms a proper subset $$K'$$ of $$\mathbb R^n$$: namely, $$K'$$ is the set of objective functions $$c$$ for which the linear program $$\max \{c^Tx:x\in P\}$$ has finite optimum. Similarly, the set $$K'\cap B_n$$ is a proper subset of $$B_n$$. Then, given the union of the spherical cones that have already been discovered by the breadth-first-search (we denote this set by $$S$$), we should redefine the dockable surface of $$S$$ as that part of the lateral surface of $$S$$ that is shared by some neighboring cones. In other words, we should exclude the part lying on the boundary of $$K'\cap B_n$$. However, this implies that Lemma 6 cannot be immediately applied.

To overcome this difficulty, we make use of the Lovász–Simonovits inequality, which we now recall. Below we use notation $$d(X,Y)$$ to indicate the Euclidean distance between two subsets $$X,Y\subseteq {\mathbb {R}}^n$$, i.e., $$d(X,Y)=\inf \{||x-y||:x\in X,y\in Y\}$$. Also, $$[x,y]$$ denotes the segment connecting two points $$x,y\in {\mathbb {R}}^n$$ (see Fig. 4).

### Theorem 7

[17] Let $$K \subseteq \mathbb {R}^n$$ be a convex compact set, $$0<\varepsilon <1$$ and $$(K_1,K_2,K_3)$$ be a partition of $$K$$ into three measurable sets such that
\begin{aligned} \forall x,y \in K, \quad d([x,y] \cap K_1, [x,y] \cap K_2) \ge \varepsilon \cdot ||x-y||. \end{aligned}
(10)
Then
\begin{aligned} {\mathrm {vol}}(K_3) \ge \frac{2\varepsilon }{1-\varepsilon } \min \big ({\mathrm {vol}}(K_1),{\mathrm {vol}}(K_2)\big ). \end{aligned}

We now illustrate how the above result can be used in our context. Let $$K = K'\cap B_n$$ and observe that $$K$$ is a convex and compact set. Let $$S\subseteq K$$ be the union of the spherical cones that have already been discovered by the breadth-first-search. We define the dockable surface of $$S$$ as that part of the lateral surface of $$S$$ that is disjoint from the boundary of $$K$$. We denote by $$D'(S)$$ the area of the dockable surface of $$S$$. We can prove the following analogue of Lemma 6:

### Lemma 8

If $${\mathrm {vol}}(S) \le \frac{1}{2} {\mathrm {vol}}(K)$$, then $$D'(S)\ge {\mathrm {vol}}(S)$$.

### Proof

Let $$F$$ denote the dockable surface of $$S$$ (thus $$D'(S)$$ is the area of $$F$$). For every $$\varepsilon >0$$ we define
\begin{aligned} K_{3,\varepsilon }&=(F+\varepsilon B_n)\cap K,\\ K_{1,\varepsilon }&=S{\setminus }K_{3,\varepsilon },\\ K_{2,\varepsilon }&=K{\setminus }(K_{1,\varepsilon }\cup K_{3,\varepsilon }), \end{aligned}
where $$X+Y$$ denotes the Minkowski sum of two subsets $$X,Y\in {\mathbb {R}}^n$$, i.e., $$X+Y=\{x+y:x\in X,y\in Y\}$$. Clearly $$(K_{1,\varepsilon },K_{2,\varepsilon },K_{3,\varepsilon })$$ is a partition of $$K$$ into three measurable sets. Furthermore, condition (10) is satisfied. Thus Theorem 7 implies that
\begin{aligned} \frac{{\mathrm {vol}}(K_{3,\varepsilon })}{2\varepsilon }\ge \frac{1}{1-\varepsilon }\min \big ({\mathrm {vol}}(K_{1,\varepsilon }),{\mathrm {vol}}(K_{2,\varepsilon })\big ). \end{aligned}
We observe that
\begin{aligned} {\mathrm {vol}}(K_{2,\varepsilon })&\ge {\mathrm {vol}}(K{\setminus }S)-{\mathrm {vol}}(K_{3,\varepsilon })\\&\ge {\mathrm {vol}}(S)-{\mathrm {vol}}(K_{3,\varepsilon })\\&\ge {\mathrm {vol}}(K_{1,\varepsilon })-{\mathrm {vol}}(K_{3,\varepsilon }). \end{aligned}
Combining those two inequalities, we find
\begin{aligned} \frac{{\mathrm {vol}}(F+\varepsilon B_n)}{2\varepsilon }\ge \frac{{\mathrm {vol}}(K_{3,\varepsilon })}{2\varepsilon }\ge \frac{1}{1-\varepsilon }({\mathrm {vol}}(K_{1,\varepsilon })-{\mathrm {vol}}(K_{3,\varepsilon })). \end{aligned}
(11)
By a well-known result in geometry (see, e.g., [9],) as $$\varepsilon$$ tends to 0 the left-hand side of (11) tends to the area of $$F$$, which is precisely the dockable surface $$D'(S)$$. Moreover, as $$\varepsilon$$ tends to $$0$$, $${\mathrm {vol}}(K_{3,\varepsilon })$$ tends to $$0$$ and $${\mathrm {vol}}(K_{1,\varepsilon })$$ tends to $${\mathrm {vol}}(S)$$. We conclude that $$D'(S) \ge {\mathrm {vol}}(S)$$. $$\square$$

Following the same approach as that used for the case of a polytope, one can show the following result for polyhedra.

### Theorem 9

Let $$P=\{x \in {\mathbb {R}}^n :Ax\le b\}$$ be a polyhedron, where all sub-determinants of $$A\in {\mathbb {Z}}^{m\times n}$$ are bounded by $$\Delta$$ in absolute value. Then the diameter of $$P$$ is bounded by $$O(\Delta ^2 n^4\log n\Delta )$$. In particular, if $$A$$ is totally unimodular, then the diameter of $$P$$ is bounded by $$O(n^4\log n)$$.

## 4 Remarks

### 4.1 Which Sub-Determinants Enter the Bound?

For simplicity, we have assumed that a bound $$\Delta$$ was given for the absolute value of all sub-determinants of $$A$$. However, our proof only uses the fact the the sub-determinants of size $$1$$ (i.e., the entries of the matrix) and $$n-1$$ are bounded. Calling $$\Delta _1$$ (resp. $$\Delta _{n-1}$$) the bound on the absolute value of the entries of $$A$$ (resp. on the sub-determinants of $$A$$ of size $$n-1$$), one easily verifies that all the results discussed above remain essentially unchanged, except that the statement of Lemma 3 becomes
\begin{aligned} \frac{D(S_v)}{{\mathrm {vol}}(S_v)}\le \Delta _1\Delta _{n-1}n^3 \end{aligned}
and the lower bound on $${\mathrm {vol}}(I_0)$$ becomes
\begin{aligned} {\mathrm {vol}}(I_0)\ge \frac{1}{n!n^{n/2}\Delta _1^n}. \end{aligned}
This implies the following strengthened result:

### Theorem 10

Let $$P=\{x \in {\mathbb {R}}^n :Ax\le b\}$$ be a polyhedron, where the entries of $$A$$ (respectively the sub-determinants of $$A$$ of size $$n-1$$) are bounded in absolute value by $$\Delta _1$$ (respectively $$\Delta _{n-1}$$). Then the diameter of $$P$$ is bounded by $$O(\Delta _1\Delta _{n-1} n^4\log n\Delta _1)$$. Moreover, if $$P$$ is a polytope, its diameter is bounded by $$O(\Delta _1\Delta _{n-1} n^{3.5}\log n\Delta _1)$$.

### 4.2 A More General Geometric Setting

Since our result was first announced in [3], Brunsch and Röglin [4] have found an algorithm to compute a short path between two given vertices of a non-degenerate polyhedron $$P = \{ x \in {\mathbb {R}}^n :Ax \le b\}$$ that runs in expected polynomial time in $$n,m$$ and $$1/\delta$$, where $$\delta$$ is a lower bound on the sine of the angle of a row of $$A$$ to the subspace of $$n-1$$ other rows of $$A$$. The expected length of the path is $$O(m n^2 / \delta ^2)$$. If $$A \in {\mathbb {Z}}^{m\times n}$$, then $$\delta \ge 1/(\Delta _1 \Delta _{n-1} n)$$, where $$\Delta _1$$ and $$\Delta _{n-1}$$ are, as before, bounds on the absolute values of $$1\times 1$$ and $$(n-1)\times (n-1)$$ sub-determinants.

Our proof technique applies in this setting as well. We have volume expansion since the normal cones cannot be too flat. The parameter $$\delta$$ is a measure for this flatness. In this setting, Lemma 1 reads as follows.

### Lemma 11

Let $$P=\{x \in {\mathbb {R}}^n :Ax\le b\}$$ be a polytope and let $$I\subseteq V$$ be a set of vertices with $${\mathrm {vol}}(I) \le (1/2) \cdot {\mathrm {vol}}(B_n)$$. Then the volume of the neighborhood of $$I$$ is at least
\begin{aligned} {\mathrm {vol}}({\mathcal {N}(I)})\ge \sqrt{\frac{2}{\pi }}\big ({\delta }/{n^{1.5}}\big )\cdot {\mathrm {vol}}(I). \end{aligned}
The proof is along the lines of the proof of Lemma 1 and by adapting Lemma 3. Here one has now
\begin{aligned} D(S_v) / {\mathrm {vol}}(S_v) \le n^2 / \delta . \end{aligned}
Theorem 2 in the geometric setting now becomes the following.

### Theorem 12

Let $$P=\{x \in {\mathbb {R}}^n :Ax\le b\}$$ be a polytope where the sine of the angle of any row of $$A$$ to the subspace generated by $$n-1$$ other rows of $$A$$ is at least $$\delta$$. The diameter of $$P$$ is bounded by $$O(n^{2.5}/\delta \cdot \ln (n/\delta ))$$.

Again, the proof is along the lines of the proof of Theorem 2 where the volume of $$S_v$$ is now lower bounded by $$\delta ^{n-1} / n!$$. In fact, the diameter bound $$O(n^{2.5}/\delta \cdot \ln (n/\delta ))$$ holds already for non-degenerate polytopes where each $$S_v$$ contains a ball of radius $$\delta$$. For polyhedra, we obtain a bound of
\begin{aligned} O\big (n^{3}/\delta \cdot \ln (n/\delta ) \big ) \end{aligned}
on the diameter.

## Footnotes

1. 1.

A counterexample to the same conjecture for unbounded polyhedra was found in 1967 by Klee and Walkup [15].

## Notes

### Acknowledgments

This work was carried out while all authors were at EPFL (École Polytechnique Fédérale de Lausanne), Switzerland. The authors acknowledge support from the DFG Focus Program 1307 within the project “Algorithm Engineering for Real-time Scheduling and Routing” and from the Swiss National Science Foundation within the project “Set-partitioning integer programs and integrality gaps”.

## References

1. 1.
Balinski, M.L.: The Hirsch conjecture for dual transportation polyhedra. Math. Oper. Res. 9(4), 629–633 (1984)Google Scholar
2. 2.
Barnette, D.: An upper bound for the diameter of a polytope. Discrete Math. 10, 9–13 (1974)Google Scholar
3. 3.
Bonifas, N., Di Summa, M., Eisenbrand, F., Hähnle, N., Niemeier, M.: On sub-determinants and the diameter of polyhedra. In: Proceedings of the 28th Annual ACM Symposium on Computational Geometry, SoCG ’12, pp. 357–362. (2012)Google Scholar
4. 4.
Brunsch, T., Röglin, H.: Finding short paths on polytopes by the shadow vertex algorithm. In: Automata, Languages, and Programming. Springer, Berlin (2013)Google Scholar
5. 5.
Brightwell, G., van den Heuvel, J., Stougie, L.: A linear bound on the diameter of the transportation polytope. Combinatorica 26(2), 133–139 (2006)
6. 6.
Dyer, M., Frieze, A.: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64(1, Ser. A), 1–16 (1994)
7. 7.
De Loera, J.A., Kim, E.D., Onn, S., Santos, F.: Graphs of transportation polytopes. J. Comb. Theory Ser. A 116(8), 1306–1325 (2009)
8. 8.
Eisenbrand, F., Hähnle, N., Razborov, A., Rothvoß, T.: Diameter of polyhedra: limits of abstraction. Math. Oper. Res. 35(4), 786–794 (2010)
9. 9.
Federer, H.: Geometric Measure Theory. Springer, New York (1969)
10. 10.
Figiel, T., Lindenstrauss, J., Milman, V.: The dimension of almost spherical sections of convex bodies. Acta Math. 139(1), 53–94 (1977)
11. 11.
Kaibel, V.: On the expansion of graphs of 0/1-polytopes. In: The Sharpest Cut. MPS/SIAM Ser. Optim., pp. 199–216. SIAM, Philadelphia (2004)Google Scholar
12. 12.
Kalai, G.: The diameter of graphs of convex polytopes and f-vector theory. In: Applied Geometry and Discrete Mathematics. DIMACS Ser. Discrete Math. Theor. Comput. Sci., vol. 4, pp. 387–411. Am. Math. Soc., Providence, RI (1991)Google Scholar
13. 13.
Kalai, G., Kleitman, D.J.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Am. Math. Soc. 26(2), 315–316 (1992)
14. 14.
Kim, E.D., Santos, F.: An update on the Hirsch conjecture. Jahresber. Dtsch. Math.-Ver. 112(2), 73–98 (2010)Google Scholar
15. 15.
Klee, V., Walkup, D.W.: The d-step conjecture for polyhedra of dimension $$d<6$$. Acta Math. 133, 53–78 (1967)Google Scholar
16. 16.
Larman, D.G.: Paths of polytopes. Proc. Lond. Math. Soc. 3(20), 161–178 (1970)
17. 17.
Lovász, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4(4), 359–412 (1993)
18. 18.
Merkle, M.: Logarithmic convexity and inequalities for the gamma function. J. Math. Anal. Appl. 203(2), 369–380 (1996)
19. 19.
Naddef, D.: The Hirsch conjecture is true for (0,1)-polytopes. Math. Program. 45, 109–110 (1989)Google Scholar
20. 20.
Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Network optimization: algorithms and applications (San Miniato, 1993). Math. Program., Ser. B 78(2), 109–129 (1997)Google Scholar
21. 21.
Santos, F.: A counterexample to the Hirsch conjecture. Annals of Math. 176(1), 383–412 (2012)Google Scholar
22. 22.
Vershynin, R.: Beyond Hirsch conjecture: walks on random polytopes and smoothed complexity of the simplex method. SIAM J. Comput. 39(2), 646–678 (2009)

## Authors and Affiliations

• Nicolas Bonifas
• 1
• 2
• Marco Di Summa
• 3
• Friedrich Eisenbrand
• 4
Email author
• Nicolai Hähnle
• 5
• Martin Niemeier
• 6
1. 1.LIX, École PolytechniquePalaiseauFrance
2. 2.IBMGentillyFrance