Fetching the paper…
Reading the bibliography…
A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$.
1904
Earlier work this paper cites.
P. Erdős, On sequences of integers no one of which divides the product of two others and on some related problems, Mitt. Forsch.-Inst. Math. Mech. Univ. Tomsk , 2
1938
Earlier work this paper cites.
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
Earlier work this paper cites.
P. Erdős, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. , 51
1945
Earlier work this paper cites.
B.A. Rogozin, On the increase of dispersion of sums of independent random variables, Teor. Verojatnost. i Primenen. , 6
1961
Earlier work this paper cites.
A. Sárkőzy and E. Szemerédi, Uber ein Problem von Erdős und Moser, Acta Arith. , 11
1965
Earlier work this paper cites.
C.G. Esseen, On the Kolmogorov–Rogozin inequality for the concentration function, Z. Wahrscheinlichkeitstheorie verw Gebiete , 5
1966
Earlier work this paper cites.
J. Komlós, On the determinant of ( 0 , 1 ) (0,1) matrices, Studia Sci. Math. Hungar. , 2
1967
Earlier work this paper cites.
G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar. , 8
1977
Earlier work this paper cites.
P. Frankl and Z. Füredi, Solution of the Littlewood–Offord problem in high dimensions, Ann. Math. , 128
1988
Earlier work this paper cites.
A. M. Odlyzko, On subspaces spanned by random selections of ± 1 \pm 1 vectors, J. Combin. Theory Ser. A , 47
1988
Earlier work this paper cites.
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
Cited alongside, same era.
K. P. Costello, T. Tao and V. Vu, Random symmetric matrices are almost surely nonsingular, Duke Math. J. , 135
2006
Cited alongside, same era.
T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc. , 20
2007
Cited alongside, same era.
M. Rudelson and R. Vershynin, The Littlewood–Offord problem and invertibility of random matrices, Adv. Math. , 218
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, Smallest singular value of a random rectangular matrix, Comm. Pure Appl. Math. , 62
2009
Cited alongside, same era.
H. H. Nguyen, Inverse Littlewood–Offord problems and the singularity of random symmetric matrices, Duke Math. J. , 161
2012
Later among the works it cites.
R. A. Horn and C. R. Johnson, Matrix Analysis (second edition), Cambridge University Press, 2013
2013
Later among the works it cites.
H. H. Nguyen and V. H. Vu, Small ball probability, inverse theorems, and applications, In: Erdős Centennial, pages 409–463. Springer, 2013
2013
Later among the works it cites.
R. Vershynin, Invertibility of symmetric random matrices, Random Structures Algorithms , 44
2014
Later among the works it cites.
V. Vu, Combinatorial problems in random matrix theory, Proc. Int. Cong. Math. , Seoul, 2014, Vol. 4, 489–508
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Tao and V. Vu, Inverse Littlewood–Offord theorems and the condition number of random discrete matrices, Ann. Math. , 169
2009
Cited alongside, same era.
T. Tao and V. Vu, From the Littlewood–Offord problem to the circular law: universality of the spectral distribution of random matrices, Bull. Amer. Math. Soc. , 46
2009
Cited alongside, same era.
J. Bourgain, V. H. Vu and P. M. Wood, On the singularity probability of discrete random matrices, J. Funct. Anal. , 258
2010
Cited alongside, same era.
M. Rudelson and R. Vershynin, Non-asymptotic theory of random matrices: extreme singular values, Proc. Int. Cong. Math. , Hyderabad, 2010, Vol. 3, 1576–1602
2010
Cited alongside, same era.
H. H. Nguyen and V. H. Vu, Optimal inverse Littlewood–Offord theorems, Adv. Math. , 226
2011
Cited alongside, same era.
2015
Later among the works it cites.
D. Saxton and A. Thomason, Hypergraph containers, Inv. Math. , 201
2015
Later among the works it cites.
J. Balogh, R. Morris and W. Samotij, The method of hypergraph containers, Proc. Int. Cong. Math. , Rio de Janeiro, 2018, Vol. 3, 3045–3078
2018
Later among the works it cites.
A. Ferber and V. Jain, Singularity of random symmetric matrices – a combinatorial approach to improved bounds, Forum Math., Sigma , 7
2019
Closest in time.
K. Tikhomirov, Singularity of random Bernoulli matrices, Ann. Math. , 191
2020
Closest in time.