Non-revisiting Conjecture for simple polytopes
Non-revisiting Conjecture for simple polytopes
Let be a simple polytope, and let and be arbitrary vertices of .
Non-revisiting Conjecture. There is a path from to which at every step enters a different facet of .
The source presents this as an equivalent formulation related to the Hirsch bound. The supplied material gives no resolution status for this formulation.
Sources & referencesView supporting material
Primary source
Edward D. Kim, “Geometric Combinatorics of Transportation Polytopes and the Behavior of the Simplex Method”, arXiv:1006.2416 (2010).
Additional references
2 papers in this index state this conjecture (2009–2010). The statement above is taken from the most recent of them; the others are arXiv:0907.1186.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.