A sharp inverse Littlewood-Offord theorem

Random Structures and Algorithms

Volumn 37, Issue 4, 2010, Pages 525-539

  Tao, Terence ^a   Vu, Van ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Additive combinatorics; Concentration probability; Inverse theorems; Littlewood offord problem; Random walks

Indexed keywords

EID: 77958533141     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20327     Document Type: Article

References (21)

1. P. Erdo{double acute}s, On a lemma of Littlewood and Offord, Bull Am Math Soc 51 (1945), 898-902.
2. P. Erdos, and L. Moser, Elementary problems and solutions: Solutions: E736., Am Math Mon 54 (1947), 229-230.
3. P. Frankl, and Z. Füredi, Solution of the Littlewood-Offord problem in high dimensions, Ann Math 128 (1988), 259-270.
4. J. Griggs, J. Lagarias, A. Odlyzko, and J. Shearer, On the tightest packing of sums of vectors, Eur J Comb 4 (1983), 231-236.
5. G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Period Math Hung 8 (1977), 197-211.
6. 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.
7. G. Katona, On a conjecture of Erdo{double acute}s and a stronger form of Sperner's theorem, Stud Sci Math Hung 1 (1966), 59-63.
8. D. Kleitman, On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors, Adv Math 5 (1970), 155-157.
9. V. Lev, Optimal representations by sumsets and subset sums, J Num Theory 62 (1997), 127-143.
10. 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.
11. M. Rudelson, and R. Vershynin, The Littlewood-Offord problem and the condition number of random matrices, Adv Math 218 (2008), 600-633.
12. A. Sárko{double acute}zy, Finite addition theorems I, J Num Thy 32 (1989), 114-130.
13. A. Sárko{double acute}zy, and E. Szemerédi, Über ein Problem von Erdo{double acute}s und Moser, Acta Arithmetica 11 (1965), 205-208.
14. R. Stanley, Weyl groups, the hard Lefschetz theorem, and the Sperner property, SIAM J. Algebraic Discrete Methods 1 (1980), 168-184.
15. E. Szemerédi, and V. Vu, Long arithmetic progressions in sumsets: thresholds and bounds, J Amer Math Soc 19 (2006), 119-169.
16. T. Tao, and V. Vu, On random (-1, 1) matrices: Singularity and determinant, Random Struct Algorithms 28 (2006), 1-23.
17. T. Tao, and V. Vu, On the singularity probability of random Bernoulli matrices, J A. M. S 20 (2007), 603-673.
18. T. Tao, and V. Vu, John type theorems for generalized arithmetic progressions and iterated sumsets, Adv Math 219 (2008), 428-449.
19. T. Tao, and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random matrices, Ann Math 169 (2009), 595-632.
20. T. Tao, and V. Vu, Random matrices: The circular law, Commun Contemp Math 10 (2008), 261-307.
21. T. Tao, and V. Vu, Additive combinatorics, Cambridge University Press, Cambridge, UK, 2006.