Metraipolis › archive › dc_8b676ec86409

On the Binary Rank of Matrices with Constant Real Rank — arXiv:2609.30203

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30203
License (as archived)
CC0-1.0
Archived
2026-10-08T06:41:06.241Z
SHA-256 of the archived text
efead5ca5a52ab270514c58414708d32b4fddaaca492bfe087a28a4c4fc578dc
Stable URL of this page
https://metraipolis.com/documento/dc_8b676ec86409

How to cite

On the Binary Rank of Matrices with Constant Real Rank — arXiv:2609.30203 — arXiv (en), https://arxiv.org/abs/2609.30203 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8b676ec86409 (Metraipolis archive dc_8b676ec86409, sha256 efead5ca5a52ab270514c58414708d32b4fddaaca492bfe087a28a4c4fc578dc)
BibTeX
@misc{dc8b676ec86409,
  title = {On the Binary Rank of Matrices with Constant Real Rank — arXiv:2609.30203},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30203},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8b676ec86409; sha256 efead5ca5a52ab270514c58414708d32b4fddaaca492bfe087a28a4c4fc578dc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30203. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We continue the study initiated by Parnas and Shraibman~\cite{PARNAS2026264} who gave upper bounds on the binary rank of $0,1$ matrices which have a small rank over the reals. We give alternative completely mathematical proofs of results proved in~\cite{PARNAS2026264} with the assistance of a computer program, and also solve one of the open problems presented there regarding the maximal binary rank of a matrix with real rank $5$. Moreover, our techniques provide a general method for giving non-trivial upper bounds on the maximal binary rank of a matrix with constant real rank. Our results also imply bounds on the equivalent problem of finding the minimum number of bicliques needed to partition the edges of a bipartite graph whose reduced adjacency matrix has real rank at most $d$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.30203 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T06:02:10.097Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).