Siegel's conjecture on intersections of Hirsch polytopes with cubes
Let be a polytope satisfying the Hirsch Conjecture, and let be a cube. The intersection is again a polytope.
Siegel's Conjecture. If satisfies the Hirsch Conjecture and is a cube, then satisfies the Hirsch Conjecture.
The conjecture was proposed as a statement about preserving the Hirsch property when a polytope is intersected with a cube, motivated by restricting every decision variable in a linear program to lie between and . The paper constructs counterexamples to this conjecture, so it is refuted.
References
Primary source
Kean P. Fallon, Madisyn Janusiak, Edward D. Kim and Avery McLain, “Counterexamples to Siegel's Conjecture”, arXiv:1912.00282 (2019).
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
No solutions have been posted yet.