Inverse Littlewood-Offord problems and the singularity of random symmetric matrices

Duke Mathematical Journal

Volumn 161, Issue 4, 2012, Pages 545-586

  Nguyen, Hoi H ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858199037     PISSN: 00127094     EISSN: None     Source Type: Journal    
DOI: 10.1215/00127094-1548344     Document Type: Article

References (26)

1. B. BOLLOBÁS, Random Graphs, Academic Press, London, 1985.
2. J. BOURGAIN, V. VU, and P. M. WOOD, On the singularity probability of discrete random matrices, J. Funct. Anal. 258 (2010), 559-603
3. K. COSTELLO, Bilinear and quadratic variants on the Littlewood-Offord problem, preprint
4. K. COSTELLO, T. TAO, and V. VU, Random symmetric matrices are almost surely nonsingular, Duke Math. J. 135 (2006), 395-413.
5. P. ERDO{double acute}S, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945), 898-902.
6. P. ERDO{double acute}S and L. MOSER, Elementary problems and solutions: Solutions, E736, Amer. Math. Monthly 54 (1947), 229-230.
7. C. G. ESSEEN, On the Kolmogorov-Rogozin inequality for the concentration function, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 5 (1966), 210-216
8. G. HALÁSZ, Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar. 8 (1977), 197-211.
9. J. KAHN, J. KOMLÓS, and E. SZEMERÉDI, On the probability that a random±1 matrix is singular, J. Amer.Math. Soc. 8 (1995), 223-240
10. M. KANTER, Probability inequalities for convex sets and multidimensional concentration functions, J. Multivariate Anal. 6 (1976), 222-236.
11. G. KATONA, On a conjecture of Erdo{double acute}s and a stronger form of Sperner's theorem, Studia Sci. Math. Hungar. 1 (1966), 59-63.
12. D. KLEITMAN, On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors, Adv. Math. 5 (1970), 155-157
13. A. KOLMOGOROV, Two uniform limit theorems for sums of independent random variables, Theory Probab. Appl. 1 (1956), 384-394. (551)
14. J. KOMLÓS, On the determinant of .0; 1/ matrices, Studia Sci. Math. Hungar. 2 (1967), 7-22.
15. J. E. LITTLEWOOD and A. C. OFFORD, On the number of real roots of a random algebraic equation, III, Rec. Math. [Mat. Sbornik] N.S. 12 (1943), 277-286.
16. H. NGUYEN and V. VU, Optimal Littlewood-Offord theorems, Adv. Math. 226 (2011), 5298-5319.
17. A. ODLYZKO, On subspaces spanned by random selections of ±1 vectors, J. Combin. Theory Ser. A 47 (1988), 124-133
18. B. A. ROGOZIN, An estimate for concentration functions, Theory Probab. Appl. 6 (1961), 94-97. (551)
19. J. ROSIŃSKI and G. SAMORODNITSKY, Symmetrization and concentration inequality for multilinear forms with applications to zero-one laws for Lévy chaos, Ann. Probab. 24 (1996), 422-437.
20. A. SÁRKÖZY and E. SZEMERÉDI, Über ein Problem von Erdo{double acute}s und Moser, Acta Arith. 11 (1965), 205-208. (550)
21. R. STANLEY, Weyl groups, the hard Lefschetz theorem, and the Sperner property, SIAM J. Algebraic Discrete Methods 1 (1980), 168-184
22. T. TAO and V. VU, Additive Combinatorics, Cambridge Stud. Adv. Math. 105, Cambridge Univ. Press, Cambridge, 2006.)
23. T. TAO and V. VU, On the singularity probability of random Bernoulli matrices, J. Amer.Math. Soc. 20 (2007), 603-628.
24. T. TAO and V. VU, Inverse Littlewood-Offord theorems and the condition number of random matrices, Ann. of Math. (2) 169 (2009), 595-632.
25. T. TAO and V. VU, A sharp inverse Littlewood-Offord theorem, Random Structures Algorithms 37 (2010), 525-539.
26. V. VU, "Random discrete matrices" in Horizons of Combinatorics, Bolyai Soc. Math. Stud. 17, Springer, Berlin, 2008, 257-280.