Fetching the paper…
Reading the bibliography…
Let $\xi$ be a real random variable with mean zero and variance one and $A={a_1,...,a_n}$ be a multi-set in $\R^d$.
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
1943
Earlier work this paper cites.
P. Erdős, On a lemma of Littlewood and Offord , Bull. Amer. Math. Soc. 51 (1945), 898-902
1945
Earlier work this paper cites.
P. Erdős and L. Moser, Elementary Problems and Solutions , Amer. Math. Monthly, 54 (1947), no. 4, 229-230
1947
Earlier work this paper cites.
H. Goldstine and J. von Neumann, Numerical inverting of matrices of high order , Bull. Amer. Math. Soc. 53 (1947), 1021-1099
1947
Earlier work this paper cites.
A. Kolmogorov, Two uniform limit theorems for sums of independent random variables , Theor. Probab. Appl. 1 (1956), 384-394
1956
Earlier work this paper cites.
A. Kolmogorov, Sur les propriétés des fonctions de concentrations de M. P. Lévy , Ann. Inst. H. Poincaré 16 (1958), 27-34
1958
Earlier work this paper cites.
S. Muroga, I. Toda, and S. Takasu, Theory of majority decision elements , J. Franklin Inst., 271, 376-418, 1961
1961
Earlier work this paper cites.
B. A. Rogozin, An estimate for concentration functions , Theor. Probab. App1. 6 (1961), 94-97
1961
Earlier work this paper cites.
D. Kleitman, On a lemma of Littlewood and Offord on the distribution of certain sums , Math. Z. 90 1965 251-259
1965
Earlier work this paper cites.
A. Sárközy and E. Szemerédi, Über ein Problem von Erdős und Moser , Acta Arithmetica 11 (1965), 205-208
1965
Earlier work this paper cites.
C. G. Esséen, On the Kolmogorov-Rogozin inequality for the concentration function , Z. Wahrsch. Verw. Gebiete 5 (1966), 210-216
1966
Earlier work this paper cites.
G. Katona, On a conjecture of Erdős and a stronger form of Sperner’s theorem . Studia Sci. Math. Hungar 1 (1966), 59-63
1966
Earlier work this paper cites.
J. Komlós, On the determinant of ( 0 , 1 ) (0,1) matrices , Studia Sci. Math. Hungar. 2 (1967), 7-22
1967
Earlier work this paper cites.
J. Komlós, On the determinant of random matrices , Studia Sci. Math. Hungar. 3 (1968), 387-399
1968
Earlier work this paper cites.
E. Szemerédi, On sets of integers containing no four elements in arithmetic progression , Acta Math. Acad. Sci. Hungar. 20 (1969), 199-245
1969
Earlier work this paper cites.
D. Kleitman, On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors , Advances in Math. 5 1970 155-157 (1970)
1970
Earlier work this paper cites.
S. Muroga, Threshold logic and its applications , Wiley-Interscience, New York, 1971
1971
Earlier work this paper cites.
G. Freiman, Foundations of a Structural Theory of Set Addition
1973
Earlier work this paper cites.
D. Kleitman, Some new results on the Littlewood-Offord problem , J. Combinatorial Theory Ser. A 20 (1976), no. 1, 89-113
1976
Earlier work this paper cites.
G. Halász, Estimates for the concentration function of combinatorial number theory and probability , Period. Math. Hungar. 8 (1977), no. 3-4, 197-211
1977
Earlier work this paper cites.
L. G. Valiant, Graph-theoretic arguments in low-level complexity , In Proceedings of the 6th MFCS, Lecture Notes in Computer Science, 53, p. 162-176, New York/Berlin, 1977, Springer-Verlag
1977
Earlier work this paper cites.
J. Griggs, The Littlewood-Offord problem: tightest packing and an M-part Sperner theorem , Europ. J. Combin. 1 (1980), 225-234
1980
Cited alongside, same era.
R. Stanley, Weyl groups, the hard Lefschetz theorem, and the Sperner property , SIAM J. Algebraic Discrete Methods 1 (1980), no. 2, 168-184
1980
Cited alongside, same era.
R. A. Proctor, Solution of two difficult combinatorial problems with linear algebra , Amer. Math. Monthly 89 (1982), no. 10, 721-734
1982
Cited alongside, same era.
A. Sali, Strong from of an M-part Sperner theorem , European J. Combinatorics 4 (1983), 179-183
1983
Cited alongside, same era.
A. Sali, A Sperner type theorem
1985
Cited alongside, same era.
A. T. Bharucha-Reid and M. Sambandham, Random polynomials , Academic Press, Orlando, 1986
T. Tao and V. Vu, Random matrices: The Circular Law , Communication in Contemporary Mathematics 10 (2008), 261-307
2008
Later among the works it cites.
A. Pajor and L. Pastur, On the limiting empirical measure of eigenvalues of the sum of rank one matrices with log-concave distribution , Studia Math. 195 (2009), no. 1, 11-29
2009
Later among the works it cites.
M. Rudelson and R. Vershynin, Smallest singular value of a random rectangular matrix
2009
Later among the works it cites.
T. Tao and V. Vu, From the Littlewood-Offord problem to the circular law: universality of the spectral distribution of random matrices,
2009
Later among the works it cites.
T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random matrices , Annals of Mathematics (2) 169 (2009), no 2, 595-632
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1986
Cited alongside, same era.
A. Edelman, Eigenvalues and condition numbers of random matrices , SIAM J. Matrix Anal. Appl. 9 (1988), no. 4, 543-560
1988
Cited alongside, same era.
P. Frankl and Z. Füredi, Solution of the Littlewood-Offord problem in high dimensions , Ann. of Math. (2) 128 (1988), no. 2, 259-270
1988
Cited alongside, same era.
J. Kahn, J. Komlós and E. Szemerédi, On the probability that a random ± 1 \pm 1 matrix is singular , J. Amer. Math. Soc. 8 (1995), 223-240
1995
Cited alongside, same era.
D. S. Gunderson, V. Rödl and A. Sidorenko, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs , J. Combin. Theory Ser. A 88 (1999), 342-367
1999
Cited alongside, same era.
D. A. Spielman and S. H. Teng, Smoothed analysis of algorithms , Proceedings of the International Congress of Mathematicians, Vol. I, 597-606, Higher Ed. Press, Beijing, 2002
2002
Cited alongside, same era.
D. A. Spielman and S. H. Teng, Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , J. ACM 51 (2004), no. 3, 385-463
2004
Cited alongside, same era.
T. Tao and V. Vu, On the permanent of random Bernoulli matrices , Adv. Math. 220 (2009), 657-669
2009
Later among the works it cites.
E. Viola, On the power of small depth computation , Foundations and Trends in Theoretical Computer Science, 5(1), 1-72, 2009
2009
Later among the works it cites.
J. Bourgain, V. Vu and P. M. Wood, On the singularity probability of discrete random matrices , Journal of Functional Analysis 258 (2010), no.2, 559-603
2010
Later among the works it cites.
F. Götze and A. Tikhomirov, The circular law for random matrices , Ann. Probab. 38 (2010), no. 4, 1444-1491
2010
Later among the works it cites.
M. Rudelson and R. Vershynin, Non-asymptotic theory of random matrices: extreme singular values , Proceedings of the International Congress of Mathematicians. Volume III, 1576-1602, Hindustan Book Agency, New Delhi, 2010
2010
Later among the works it cites.
T. Tao and V. Vu, A sharp inverse Littlewood-Offord theorem , Random Structures Algorithms 37 (2010), no. 4, 525-539
2010
Later among the works it cites.
T. Tao and V. Vu, Smooth analysis of the condition number and the least singular value
2010
Later among the works it cites.
T. Tao and V. Vu, Random matrices: the distribution of the smallest singular values , Geom. Funct. Anal. 20 (2010), no. 1, 260-297
2010
Later among the works it cites.
H. Nguyen and V. Vu, Optimal Littlewood-Offord theorems , Advances in Math., Vol. 226 6 (2011), 5298-5319
2011
Later among the works it cites.
C. Bordenave and D. Chafai, Around the circular law , Probab. Surveys 9 (2012), 1-89
2012
Closest in time.
H. Nguyen, Inverse Littlewood-Offord problems and the singularity of random symmetric matrices , Duke Mathematics Journal Vol. 161, 4 (2012), 545-586
2012
Closest in time.
H. Nguyen, A new approach to an old problem of Erdős and Moser
2012
Closest in time.
A. Razborov and E. Viola, Real Advantage , submitted, http://eccc.hpi-web.de/report/2012/134/
2012
Closest in time.
T. Tao and V. Vu, The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi , Combinatorica 32 (2012), no. 3, 363-372
2012
Closest in time.
T. Tao and V. Vu, Random matrices: universality of ESDs and the circular law , Ann. Probab. 38 (2010), no. 5p. 2023-2065, with an appendix by M. Krishnapur
2065
Closest in time.