arXiv · 2611.16231
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Avinash Bhardwaj, Vishnu Narayanan. 2026-11-12. A Polynomial Bound on Split Rank. https://searcharxiv.com/abs/2611.16231
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.