Work

A Polynomial Bound on Split Rank

Year: 2026
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W7225989508
Cites: 1
Cited by:
Related to: 10