Related papers: Observations on the Perturbed Wedge
In 2010 Santos described the construction of a counterexample to the Hirsch conjecture, and in 2012 Santos and Weibel provided the coordinates for the 40 facets of a 20-dimensional counterexample. In this paper we explore technical details…
Francisco Santos has described a new construction, per- turbing apart a non-simple face, to offer a counterexample to the Hirsch Conjecture. We offer two observations about this perturbed wedge con- struction, regarding its effect on…
Santos' construction of counter-examples to the Hirsch Conjecture (2012) is based on the existence of prismatoids of dimension d of width greater than d. Santos, Stephen and Thomas (2012) have shown that this cannot occur in $d \le 4$.…
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 Hirsch Conjecture stated that any $d$-dimensional polytope with n facets has a diameter at most equal to $n - d$. This conjecture was disproved by Santos (A counterexample to the Hirsch Conjecture, Annals of Mathematics, 172(1) 383-412,…
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…
From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets $f$ and dimension $d$. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…
W. M. Hirsch formulated a beautiful conjecture on diameters of convex polyhedra.I suggest a new viewpoint with the deformation and moduli of polytopes.
We prove that the intersection of a Hirsch polytope and a cube may be a non-Hirsch polytope.
Polytopes are one of the most primitive concepts underlying geometry. Discovery and study of polytopes with complex structures provides a means of advancing scientific knowledge. Construction of polytopes with specific extremal structure is…
We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We extend our previous work by building a smooth complete manifold $(M^6,g,p)$ with $\mathrm{Ric}\geq 0$ and whose fundamental group $\pi_1(M^6)=\mathbb{Q}/\mathbb{Z}$ is infinitely generated. The example is built with a variety of…
We construct a Z_2 orbifold projection of SU(N) gauge theories formulated in five dimensions with a compact fifth dimension. We show through a non-perturbative argument that no boundary mass term for the Higgs field, identified with some of…
Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…
We construct a compact PL 5-manifold $M$ (with boundary) which is homotopy equivalent to the wedge of eleven 2-spheres, $\vee^{}_{1 1}S^2$, which is "spineless", meaning $M$ is not the regular neighborhood of any 2-complex PL embedded in…
Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…