Fetching the paper…
Reading the bibliography…
Let $\epsilon_1, \dotsc, \epsilon_n$ be i.i.d.
On the number of real roots of a random algebraic equation. III
J. E. Littlewood and A. C. Offord · 1943
Earlier work this paper cites.
On a lemma of Littlewood and Offord
P. Erdős · 1945
Earlier work this paper cites.
Elementary Problems and Solutions: Solutions: E736
P. Erdős and L. Moser · 1947
Earlier work this paper cites.
Über ein Problem von Erdős und Moser
A. Sárkőzy and E. Szemerédi · 1965
Earlier work this paper cites.
On the determinant of ( 0 , 1 ) (0,\,1) matrices
J. Komlós · 1967
Earlier work this paper cites.
Estimates for the concentration function of combinatorial number theory and probability
G. Halász · 1977
Earlier work this paper cites.
The solution of van der Waerden’s problem for permanents
G. P. Egorychev · 1981
Earlier work this paper cites.
On the probability that a random ± 1 \pm 1 -matrix is singular
J. Kahn, J. Komlós, and E. Szemerédi · 1995
Cited alongside, same era.
Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
E. R. Canfield and B. D. McKay · 2005
Cited alongside, same era.
Additive combinatorics
T. Tao and V. Vu · 2006
Cited alongside, same era.
On the singularity probability of random Bernoulli matrices
T. Tao and V. Vu · 2007
Cited alongside, same era.
Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
T. Tao and V. H. Vu · 2009
Cited alongside, same era.
On the singularity probability of discrete random matrices
J. Bourgain, V. H. Vu, and P. M. Wood · 2010
Cited alongside, same era.
Optimal inverse Littlewood-Offord theorems
H. Nguyen and V. Vu · 2011
Later among the works it cites.
On the singularity of random combinatorial matrices
H. H. Nguyen · 2013
Later among the works it cites.
Small ball probability, inverse theorems, and applications
H. H. Nguyen and V. H. Vu · 2013
Later among the works it cites.
Discrepancy properties for random regular digraphs
N. A. Cook · 2017
Later among the works it cites.
On the singularity of adjacency matrices for random regular digraphs
N. A. Cook · 2017
Later among the works it cites.
Approximate Spielman-Teng theorems for random matrices with heavy tailed entries: a combinatorial view
V. Jain · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A sharp inverse Littlewood-Offord theorem
T. Tao and V. Vu · 2010
Cited alongside, same era.
Singularity of random symmetric matrices–a combinatorial approach to improved bounds
A. Ferber and V. Jain
Cited in the paper.
Random integral matrices: universality of surjectivity and the cokernel
H. H. Nguyen and M. M. Wood
Cited in the paper.
Singularity of random Bernoulli matrices
K. Tikhomirov
Cited in the paper.
Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
V. Jain · 2019
Closest in time.