arXiv (All)
open access
The smallest singular value of products of random combinatorial and deterministic matrices
Let $p\in(0,1/2]$ be fixed, and let $d,n$ be positive integers satisfying $d=pn$. Let $Q_n$ be an $n\times n$ random combinatorial matrix whose rows are independent and uniformly distributed over the vectors in $\{0,1\}^n$ having exactly $d$ ones. For an arbitrary deterministic invertible $n\times n
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
- Exponential Rank Bounds for Random Matrices#986280
- Real-rootedness of Kazhdan--Lusztig polynomials of sparse paving matroids#1216474
- Exact Second-Order Asymptotics for the Discrete Wyner--Ziv Problem#1249278
- On the enumeration of polymatroids#793873
- On the enumeration of polymatroids#789854
Record · ID 1489658
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