Split-rank conjecture of Basu, Conforti, Di Summa, and Jiang
Let be a bounded rational polytope, let denote its binary encoding length, and let . For and , define the split disjunction or . If is the intersection, over all such disjunctions, of the convex hulls obtained by imposing the disjunction on , and denotes iterations of this operation, then there should be a polynomial bound on the split rank: there exists a polynomial such that for every bounded rational pure-integer polytope , with the bound applying in unrestricted dimension.
References
- Split Cuts in Fixed Integer Dimensions — arXiv — Avinash Bhardwaj, Vishnu Narayanan
Source: arXiv
Progress summary
A November 2026 unrefereed preprint proves the conjecture for bounded integer polytopes in each fixed dimension, but the full conjecture remains open.
The conjecture concerns bounds on split rank in integer optimization. A new preprint establishes the predicted behavior for bounded pure-integer polytopes when the dimension is fixed, rather than settling the unrestricted conjecture.
November 2026 fixed-dimensional result
Avinash Bhardwaj and Vishnu Narayanan claim polynomial split rank and a polynomial-time constructible split proof for bounded pure-integer polytopes in every fixed dimension, with related results for split closures and mixed-integer systems. This is substantial progress, but it covers only a fixed-dimensional class and is reported in an unrefereed preprint.
Current status (as of November 2026): The conjecture is claimed for bounded pure-integer polytopes in fixed dimension, while the general conjecture remains open and the new result is unverified.
Sources
Solutions 0
No solutions have been posted yet.