On the singularity probability of random Bernoulli matrices
Top Cited Papers
- 6 February 2007
- journal article
- Published by American Mathematical Society (AMS) in Journal of the American Mathematical Society
- Vol. 20 (3) , 603-628
Abstract
Let n n be a large integer and let M n M_n be a random n × n n \times n matrix whose entries are i.i.d. Bernoulli random variables (each entry is ± 1 \pm 1 with probability 1 / 2 1/2 ). We show that the probability that M n M_n is singular is at most ( 3 / 4 + o ( 1 ) ) n (3/4 +o(1))^n , improving an earlier estimate of Kahn, Komlós and Szemerédi, 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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- SETS WITH SMALL SUMSET AND RECTIFICATIONBulletin of the London Mathematical Society, 2006
- On random ±1 matrices: Singularity and determinantRandom Structures & Algorithms, 2005
- A polynomial bound in Freiman's theoremDuke Mathematical Journal, 2002
- Rectification Principles in Additive Number TheoryDiscrete & Computational Geometry, 1998
- On the Probability That a Random ± 1-Matrix Is SingularJournal of the American Mathematical Society, 1995
- Generalized arithmetical progressions and sumsetsActa Mathematica Hungarica, 1994
- On subspaces spanned by random selections of ±1 vectorsJournal of Combinatorial Theory, Series A, 1988
- Estimates for the concentration function of combinatorial number theory and probabilityPeriodica Mathematica Hungarica, 1977
- An Introduction to the Geometry of Numbers. By J. W. S. Cassels. Pp. 344. DM. 69. 1959. (Springer, Berlin)The Mathematical Gazette, 1961
- On a lemma of Littlewood and OffordBulletin of the American Mathematical Society, 1945