On the singularity probability of random Bernoulli matrices
Abstract
Let n be a large integer and Mn be a random n by n matrix whose entries are i.i.d. Bernoulli random variables (each entry is 1 with probability 1/2). We show that the probability that Mn is singular is at most (3/4 +o(1))n, improving an earlier estimate of Kahn, Koml\'os and Szemer\'edi, as well as earlier work by the authors. The key new ingredient is the applications of Freiman type inverse theorems and other tools from additive combinatorics.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.