works on
coherent monotone paths 1exponential lower bounds 1Hirsch conjecture 1linear programming 1polytopes 1shadow simplex method 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

math.CO2026

Any Proof of Polynomial Hirsch Must be Completely Incoherent

Alexander E. Black, Lei Xue

The paper constructs families of polytopes for which every coherent monotone path induced by a linear function has exponential length, disproving a polynomial‑Hirsch‑type conjectur…