The singularity probability of a random symmetric matrix is exponentially small
Abstract
Let A be drawn uniformly at random from the set of all n× n symmetric matrices with entries in \-1,1\. We show that \[ P( (A) = 0 ) ≤ e-cn,\] where c>0 is an absolute constant, thereby resolving a well-known conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.