The Littlewood–Offord problem and invertibility of random matrices
Authors:
- Mark RudelsonMRMark Rudelson
- Roman VershyninRVRoman Vershynin
Top Cited Papers
- 1 June 2008
- journal article
- Published by Elsevier in Advances in Mathematics
- Vol. 218 (2) , 600-633
Abstract
No abstract availableKeywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Inverse Littlewood–Offord theorems and the condition number of random discrete matricesAnnals of Mathematics, 2009
- Invertibility of random matrices: norm of the inverseAnnals of Mathematics, 2008
- On the singularity probability of random Bernoulli matricesJournal of the American Mathematical Society, 2007
- On random ±1 matrices: Singularity and determinantRandom Structures & Algorithms, 2005
- Smallest singular value of random matrices and geometry of random polytopesAdvances in Mathematics, 2005
- On the Probability That a Random ± 1-Matrix Is SingularJournal of the American Mathematical Society, 1995
- Solution of the Littlewood-Offord Problem in High DimensionsAnnals of Mathematics, 1988
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- Estimates for the concentration function of combinatorial number theory and probabilityPeriodica Mathematica Hungarica, 1977
- On a lemma of Littlewood and OffordBulletin of the American Mathematical Society, 1945