no. 14 · Friday 13 November 2026
A Polynomial Bound on Split Rank
Abstract
We prove that the split rank of a rational pure-integer polyhedron is polynomially bounded in its input length, resolving a conjecture of Basu, Conforti, Di Summa, and Jiang. If the defining system has dense binary encoding length $L$, then $O((L+1)^9)$ split rounds suffice to reach the integer hull in arbitrary dimension.
- fields
- Optimization and Control, Combinatorics