Related papers: The width of 5-dimensional prismatoids
The purpose of this paper is the formal verification of a counterexample of Santos et al. to the so-called Hirsch Conjecture on the diameter of polytopes (bounded convex polyhedra). In contrast with the pen-and-paper proof, our approach is…
The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…
Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatorial diameters. The main open problem in this area is the…
It is shown here that the diameter of the $d$-dimensional cyclohedron is not greater than $\lceil 5d/2\rceil-2$. It is also shown that the $5/2$ coefficient in this upper bound is asymptotically sharp. More precisely, the $d$-dimensional…
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…
This is an expository paper (in Spanish) describing the origin and history of the Hirsch Conjecture about the maximum diameter of graphs of polytopes, and the ideas that led to the counter-example to it recently announced by the author in…
We investigate the structure of smooth and horizonless microstate geometries in six dimensions, in the spirit of the five-dimensional analysis of Gibbons and Warner [arXiv:1305.0957]. In six dimensions, which is the natural setting for…
We solve a problem in the combinatorics of polyhedra motivated by the network simplex method. We show that the Hirsch conjecture holds for the diameter of the graphs of all network-flow polytopes, in particular the diameter of a…
We develop the analysis of the asymptotic properties of gravity in higher spacetime dimensions $D$, with a particular emphasis on the case $D=5$. Our approach deals with spatial infinity and is Hamiltonian throughout. It is shown that the…
We improve Larman's bound on the diameter of a polytope by showing that if $\Delta$ is a normal simplicial complex, all of whose missing faces have size at most $r$, then the diameter of the facet-ridge graph of $\Delta$ is not larger than…
In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…
We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction.…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
It is proven here that the diameter of the d-dimensional associahedron is 2d-4 when d is greater than 9. Two maximally distant vertices of this polytope are explicitly described as triangulations of a convex polygon, and their distance is…
Let $S\subset\Ps^r$ ($r\geq 5$) be a nondegenerate, irreducible, smooth, complex, projective surface of degree $d$. Let $\delta_S$ be the number of double points of a general projection of $S$ to $\Ps^4$. In the present paper we prove that…
The 5-dimensional (5d) Birkhoff theorem gives the class of 5d vacuum space-times containing spatial hypersurfaces with cosmological symmetries. This theorem is violated by the 5d vacuum Gergely-Maartens (GM) space-time, which is not a…
As was pointed out by Nikulin [8] and Vinberg [10], a right-angled polyhedron of finite volume in hyperbolic n-space $\mathbb{H}^n$ has at least one cusp for $n\geq 5$. We obtain non-trivial lower bounds on the number of cusps of such…
For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…
For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…