Skip to content
DraconiticResearch
Search Sources API
226,742 studies31 sourcesUpdated 40 min ago
PreprintCC BY 4.0arXiv

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.

Related

  1. Nil-Brauer categorifies the split iquantum group of rank one
    Jonathan Brundan, Weiqiang Wang, Ben Webster
    Forum of Mathematics SigmaPeer-reviewedCC BYFull text14 citedGeometry & topologyOpenAlex
  2. Split-Free Cable Expressions: Active Neighborhood Profiles and Linear Rank-Width
    Antonios Kalampakas
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Nonnegativity of the g-polynomial of split matroids
    Alice L. L. Gao, Matthew H. Y. Xie
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Comment on "The polarization hierarchy for polynomial optimization over convex bodies, with applications to nonnegative matrix rank"
    Julius A. Zeiss
    arXivPreprintCC BY 4.0Full textOptimisation & controlQuantum physics & quantum informationarXiv
  5. A relative Schinzel-Zassenhaus bound for the polynomial T2 − 1
    Alessio Cangini
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{bhardwaj2026polynomial,
  title = {{A Polynomial Bound on Split Rank}},
  author = {Avinash Bhardwaj and Vishnu Narayanan},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.16231},
  eprint = {2611.16231},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.16231},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - A Polynomial Bound on Split Rank
AU  - Avinash Bhardwaj
AU  - Vishnu Narayanan
PY  - 2026
DA  - 2026/11/12
PB  - arXiv
DO  - 10.48550/arxiv.2611.16231
UR  - https://arxiv.org/abs/2611.16231
AB  - 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.
ER  -