Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Spielman-Teng Conjecture

Published 30 May 2024 in math.PR and math.CO | (2405.20308v2)

Abstract: Let $M$ be an $n\times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $\sigma_n(M)$ denote the least singular value of $M$. We prove that [\mathbb{P}\big( \sigma_{n}(M) \leq \varepsilon n{-1/2} \big) = (1+o(1)) \varepsilon + e{-\Omega(n)}] for all $0 \leq \varepsilon \ll 1$. This resolves, up to a $1+o(1)$ factor, a seminal conjecture of Spielman and Teng.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 2 likes about this paper.