When Binary Cuts Hint a Hidden Line in Polytopes
Geometric shapes aren’t just pretty ornaments on a chalkboard. In optimization, they’re enormous, living laboratories where tiny binary decisions ripple into sweeping consequences. The CUT(n) polytope—the convex hull of cut vectors of a complete graph Kn—has loomed as a central but stubborn mystery: its vertices are famously elusive to describe with a neat, closed-form formula….