An Approach to the Hirsch Conjecture
英文摘要：
W. M. Hirsch formulated a beautiful conjecture on diameters of convex polyhedra.I suggest a new viewpoint with the deformation and moduli of polytopes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
关于 Hirsch 猜想反例的回路直径猜想
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
本文证明 Hirsch 猜想在有界多面体和单调游走情形下的经典反例均不能迁移到回路直径猜想，并通过结构几何分析与全量枚举给出两种验证路径。
math.COmath.OC
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the diameters of polyhedral graphs. One particular variant has a diameter which satisfies the best known upper bound on the diameters of polyhedra. Another variant has superlinear asymptotic diameter, and together with some combinatorial operations, gives a concrete approach for disproving the Linear Hirsch Conjecture.
math.COmath.OC
The Hirsch conjecture holds for normal flag complexes
Using an intuition from metric geometry, we prove that any flag and normal simplicial complex satisfies the non-revisiting path conjecture. As a consequence, the diameter of its facet-ridge graph is smaller than the number of vertices minus the dimension, as in the Hirsch conjecture. This proves the Hirsch conjecture for all flag polytopes, and more generally, for all (connected) flag homology manifolds.
math.COmath.MGmath.OC
An update on the Hirsch conjecture
The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most fundamental, basic and old problems in polytope theory, what we know is quite scarce. Most notably, no polynomial upper bound is known for the diameters that are conjectured to be linear. In contrast, very few polytopes are known where the bound $n-d$ is attained. This paper collects known results and remarks both on the positive and on the negative side of the conje…
math.COmath.OC
Companion to "An update on the Hirsch conjecture"
This is an appendix to our paper "An update of the Hirsch Conjecture" (arXiv:0907.1186), containing proofs of some of the results and comments that were omitted in it.
math.CO
Counterexamples to Siegel's Conjecture
We prove that the intersection of a Hirsch polytope and a cube may be a non-Hirsch polytope.
math.COmath.OC
更多相关论文收起更多论文
A counterexample to the Hirsch conjecture
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 $n-d$ edges. This paper presents the first counterexample to the conjecture. Our polytope has dimension 43 and 86 facets. It is obtained from a 5-dimensional polytope with 48 facets which violates a certain generalization of the $d$-step conjecture of Klee and Walkup.
cs.DMmath.COmath.OC
The Diameters of Network-flow Polytopes satisfy the Hirsch Conjecture
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 network-flow polytope for a network with $n$ nodes and $m$ arcs is never more than $m+n-1$. A key step to prove this is to show the same result for classical transportation polytopes.
math.CO
The Hierarchy of Circuit Diameters and Transportation Polytopes
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 conjecture is true for general $m{\times}n$--transportation polytopes. In earlier work the first three authors introduced a hierarchy of variations to the notion of graph diameter in polyhedra. The key reason was that this hierarchy provides some interesting lower bounds for the usual graph diameter. This paper has three contributions: First, we compare the hierarc…
math.COmath.OC
A Formal Disproof of the Hirsch Conjecture
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 entirely computational: we implement in Coq and prove correct an algorithm that explicitly computes, within the proof assistant, vertex-edge graphs of polytopes as well as their diameter. The originality of this certificate-based algorithm is to achieve a tradeoff between simplicity and efficiency. Simplicity is crucial in obtaining the proof of correctness …
cs.LOmath.COmath.OC
Sobre un contraejemplo a la conjetura de 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 arxiv:1006.2814
math.CO
Circuit diameter and Klee-Walkup constructions
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to minimally-dependent subsystems of the presentation of the polyhedron. These can be understood as the set of all possible edge directions, including edges that may arise from translation of the facets. It is appealing to consider a circuit analogue of the Hirsch conjecture for graph diameter, as suggested by Borgwardt et al. [BFH15]. They ask whether the known counter…
cs.CGmath.CO
On the Circuit Diameter Conjecture
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 bound of $f-d$ was shown to be equivalent to several seemingly simpler statements, and was disproved for unbounded polyhedra through the construction of a particular 4-dimensional polyhedron $U_4$ with 8 facets. The Hirsch bound for bounded polyhedra was only recently disproved by Santos. We consider analogous properties for a variant of the combinatorial d…
math.CO
Observations on the Perturbed Wedge
Santos' construction of the first known counterexample to the Hirsch conjecture, for bounded polytopes, follows the strategy of first finding a counterexample to the nonrevisiting conjecture. Santos constructs a $5$-dimensional all-but-simple spindle $(P,x,y)$ of length $6$, which is a counterexample to the nonrevisiting conjecture. For simple polytopes, if we had a counterexample to the nonrevisiting conjecture, we would produce the corresponding counterexample to the Hirsch conjecture through repeated wedging, over all the facets not incident to $x$ or $y$. However, Santos $5$-dimensional sp…
math.COmath.MG
On the Combinatorial Diameters of Parallel and Series Connections
The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the simplex method. We are interested in the diameters of polyhedra formed from the so-called parallel or series connection of oriented matroids: oriented matroids are the natural way to connect representable matroid theory with the combinatorics of linear programming, and these connections are fundamental operations for the construction of more complicated matroids from elementary matroid blocks. We prove that, for polyh…
math.COmath.OC
Topological Prismatoids and Small Simplicial Spheres of Large Diameter
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' that allows to construct such large-diameter polytopes from `non-$d$-step' prismatoids still works at this combinatorial level. Then, using metaheuristic methods on the flip graph, we construct four combinatorially different non-$d$-step $4$-dimensional topological prismatoids with $14$ vertices. This implies the existence of $8$-dimensional spheres with $18$ v…
math.CO
Geometric Combinatorics of Transportation Polytopes and the Behavior of the Simplex Method
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 non-negative real numbers satisfying certain summation conditions. Transportation problems are, in many ways, the simplest kind of linear programs and thus have a rich combinatorial structure. First, we give new results on the diameters of certain classes of transportation polytopes and their relation to the Hirsch Conjecture, which asserts that the diamete…
math.CO
Improving the Bounds On Murty_Simon Conjecture
A graph is said to be diameter-$k$-critical if its diameter is $k$ and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that every diameter-2-critical graph of order $n$ has at most $\lfloor n^2/4\rfloor$ edges and equality holds only for $K_{\lceil n/2 \rceil,\lfloor n/2 \rfloor }$. Haynes et al. proved that the conjecture is true for $Δ\geq 0.7n$. They also proved that for $n>2000$, if $Δ\geq 0.6789n$ then the conjecture is true. We will improve this bound by showing that the conjecture is true for every $n$ if $Δ\geq\ 0.676n$.
math.CO
Recent progress on the combinatorial diameter of polytopes and simplicial complexes
The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the underlying question is quite scarce. Most notably, no polynomial upper bound is known for the diameters that were conjectured to be linear. In contrast, no polyhedron violating the conjecture by more than 25% is known. This paper reviews several recent attempts and progress on the question. Some work in the world of polyhedra or (more often) bounded polytopes, but s…
math.COmath.OC
More bounds on the diameters of convex polytopes
Finding a good bound on the maximal edge diameter $Δ(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known, the behaviour of the function $Δ(d,n)$ is largely unknown. The Hirsch conjecture, formulated in 1957 and reported in \cite{GD}, states that $Δ(d,n)$ is linear in $n$ and $d$: $Δ(d,n) \leq n-d$. The conjecture is known to hold in small dimensions, i.e., for $d \leq 3$ \cite{VK}, along with other specific pairs of $d$ and $n$ (Table \ref{before}). However, the asympt…
math.COmath.MG
The Catalan case of Armstrong's conjecture on simultaneous core partitions
A beautiful recent conjecture of D. Armstrong predicts the average size of a partition that is simultaneously an $s$-core and a $t$-core, where $s$ and $t$ are coprime. Our goal is to prove this conjecture when $t=s+1$. These simultaneous $(s,s+1)$-core partitions, which are enumerated by Catalan numbers, have average size $\binom{s+1}{3}/2$.
math.ACmath.COmath.NT
Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n-d \leq 6. We show this result by showing this bound for a more general structure -- so-called matroid polytopes -- by reduction to a small number of satisfiability problems.
math.COmath.MG
