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.
Source: arXiv (Cornell University)
Authors: Bhardwaj, Avinash, Narayanan, Vishnu
Institution: Indian Institute of Technology Bombay
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225989508
