arXiv (All)
open access
On the Binary Rank of Matrices with Constant Real Rank
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 comput
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
- Uniqueness of size-2 positive semidefinite matrix factorizations#798570
- Uniqueness of size-2 positive semidefinite matrix factorizations#797157
- A \(3\times 3\) counterexample to Lin and Wimmer's rank-minimization conjecture associated with Roth's similarity theorem#975173
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
Record · ID 1078274
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive