Polyhedrality conjecture for the k-halfspace closure
Polyhedrality conjecture for the k-halfspace closure
Let be fixed. For a rational polyhedron , define the -halfspace closure by
where denotes the integer hull of . Polyhedrality conjecture for the -halfspace closure. For any fixed natural number , and any rational polyhedron , is a rational polyhedron. This asks whether the closure obtained by intersecting integer hulls of all -halfspace rational relaxations remains finitely describable by rational linear inequalities; the source gives no resolution, so the conjecture remains open.
Sources & referencesView supporting material
Primary source
Amitabh Basu and Hongyi Jiang, “Two-halfspace closure”, arXiv:2006.11587 (2021).
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.