Metraipolis › archive › dc_1fe7ae4ffe35

Sharp singularity asymptotics for discrete random matrices — arXiv:2609.39463

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39463
License (as archived)
CC0-1.0
Archived
2026-10-07T14:15:03.094Z
SHA-256 of the archived text
176f2676077246476a9fb3a067f052c24db85b006f465a09b5c0f23f5719b533
Stable URL of this page
https://metraipolis.com/documento/dc_1fe7ae4ffe35

How to cite

Sharp singularity asymptotics for discrete random matrices — arXiv:2609.39463 — arXiv (en), https://arxiv.org/abs/2609.39463 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1fe7ae4ffe35 (Metraipolis archive dc_1fe7ae4ffe35, sha256 176f2676077246476a9fb3a067f052c24db85b006f465a09b5c0f23f5719b533)
BibTeX
@misc{dc1fe7ae4ffe35,
  title = {Sharp singularity asymptotics for discrete random matrices — arXiv:2609.39463},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39463},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1fe7ae4ffe35; sha256 176f2676077246476a9fb3a067f052c24db85b006f465a09b5c0f23f5719b533},
  year = {2026}
}

Archived text

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

We resolve the Rademacher singularity conjecture: an $n\times n$ matrix with independent uniform $\{-1,1\}$ entries is singular with probability $(2+o(1))n^22^{-n}$. More generally, for an $n\times n$ matrix $M_n$ with independent entries uniform on a fixed set $S\subset\mathbb{R}$ of cardinality $q\ge2$, we prove $\mathbb{P}(s_n(M_n)\le z/\sqrt{n}) \le Cz+a_n(S)+C'n^{1+\varepsilon}q^{-n}$ for all $n\ge1$, $z\ge0$, and $\varepsilon>0$, with $C=C(S)$ and $C'=C'(S,\varepsilon)$. Here $s_n$ denotes the least singular value, and $a_n(S)$ sums the probabilities of zero rows or columns and equal or opposite pairs of rows or columns. The proof combines inversion of randomness with Fourier averaging at scales within a polynomial factor of $q^n$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.39463 — 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-07T14:04:17.214Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).