Optimal inverse Littlewood-Offord theorems

Advances in Mathematics

Volumn 226, Issue 6, 2011, Pages 5298-5319

  Nguyen, Hoi ^a   Vu, Van ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

11B25; Concentration probability; Generalized arithmetic progression; Inverse Littlewood Offord problem

Indexed keywords

EID: 79952037315     PISSN: 00018708     EISSN: 10902082     Source Type: Journal    
DOI: 10.1016/j.aim.2011.01.005     Document Type: Article

References (21)

1. Erdo o double acute s P. On a lemma of Littlewood and Offord. Bull. Amer. Math. Soc. 1945, 51:898-902.
2. Erdo o double acute s P., Moser L. Elementary problems and solutions. Amer. Math. Monthly 1947, 54(4):229-230.
3. Griggs J. Database security and the distribution of subset sums in Rm. Bolyai Soc. Math. Stud. 1999, 7:223-252.
4. Halász G. Estimates for the concentration function of combinatorial number theory and probability. Period. Math. Hungar. 1977, 8(3-4):197-211.
5. Katona G. On a conjecture of Erdo o double acute s and a stronger form of Sperner's theorem. Studia Sci. Math. Hungar. 1966, 1:59-63.
6. Littlewood J.E., Offord A.C. On the number of real roots of a random algebraic equation. III. Rec. Math. Mat. Sb. N.S. 1943, 12:277-286.
7. H. Nguyen, A new approach to an old problem of Erdo o double acute s and Moser, submitted for publication.
8. Proctor R.A. Solution of two difficult combinatorial problems with linear algebra. Amer. Math. Monthly 1982, 89(10):721-734.
9. Rudelson M., Vershynin R. The Littlewood-Offord problem and the condition number of random matrices. Adv. Math. 2008, 218(2):600-633.
10. Sárközy A., Szemerédi E. Über ein Problem von Erdo o double acute s und Moser. Acta Arith. 1965, 11:205-208.
11. Stanley R. Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Algebraic Discrete Methods 1980, 1(2):168-184.
12. Szemerédi E., Vu V. Long arithmetic progressions in sumsets: thresholds and bounds. J. Amer. Math. Soc. 2006, 19:119-169.
13. Tao T. Freiman's theorem in solvable groups http://arxiv.org/abs/0906.3535.
14. Tao T., Vu V. Additive Combinatorics 2006, Cambridge Univ. Press.
15. Tao T., Vu V. On the singularity probability of random Bernoulli matrices. J. Amer. Math. Soc. 2007, 20:603-673.
16. Tao T., Vu V. Random matrices: The circular law. Commun. Contemp. Math. 2008, 10:261-307.
17. Tao T., Vu V. John-type theorems for generalized arithmetic progressions and iterated sumsets. Adv. Math. 2008, 219(2):428-449.
18. Tao T., Vu V. From the Littlewood-Offord problem to the circular law: universality of the spectral distribution of random matrices. Bull. Amer. Math. Soc. (N.S.) 2009, 46(3):377-396.
19. Tao T., Vu V. Inverse Littlewood-Offord theorems and the condition number of random matrices. Ann. of Math. (2) 2009, 169(2):595-632.
20. Tao T., Vu V. A sharp inverse Littlewood-Offord theorem. Random Structures Algorithms 2010, 37(4):525-539.
21. Tao T., Vu V. Smooth analysis of the condition number and the least singular value. Math. Comp. 2010, 79:2333-2352.