← All problems

Sankar–Teng–Spielman least singular value conjecture for subgaussian random matrices

10 years old · traced to

Let ξ\xi be a mean-zero, variance-at-least-11, subgaussian random variable, and let NnN_n be an n×nn\times n random matrix with iid entries distributed as ξ\xi. The least singular value of NnN_n is denoted by sn(Nn)s_n(N_n). Sankar–Teng–Spielman conjecture. There exist constants C,c>0C,c>0 such that, for every ε≥0\varepsilon\geq 0,

P(sn(Nn)≤εn−1/2)≤Cε+cn.{\mathbb{P}}\bigl(s_n(N_n)\leq \varepsilon n^{-1/2}\bigr)\leq C\varepsilon+c^n.

This conjecture seeks a uniform small-ball estimate for the least singular value beyond the Gaussian and smoothed-analysis settings.

References

Status

  • Solved: Mark Rudelson and Roman Vershynin. The Littlewood–Offord Problem and Invertibility of Random Matrices (Advances in Mathematics, 2008) https://arxiv.org/abs/0805.3407

Source: Kyle Luh, “Complex Random Matrices have no Real Eigenvalues”, arXiv:1609.07679 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.