The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the probability that a random ±1-matrix is singular
Open accessAbstract
We report some progress on the old problem of estimating the probability, P n , that a random n ×<!-- × --> n ±<!-- ± --> 1 -matrix is singular: Theorem. There is a positive constant ε<!-- ε --> for which P n > ( 1 −<!-- − --> ε<!-- ε --> ) n . This is a considerable improvement on the best previous bound, P n = O ( 1 / n ) , given by Komlós in 1977, but still falls short of the often-conjectured asymptotical formula P n = ( 1 + o ( 1 ) ) n 2 2 1 −<!-- − --> n . The proof combines ideas from combinatorial number theory, Fourier analysis and combinatorics, and some probabilistic constructions. A key ingredient, based on a Fourier-analytic idea of Halász, is an inequality (Theorem 2) relating the probability that a _<!-- _ --> ∈<!-- ∈ --> R n is orthogonal to a random ε<!-- ε --> _<!-- _ --> ∈<!-- ∈ --> { ±<!-- ± --> 1 } n to the corresponding probability when ε<!-- ε --> _<!-- _ --> is random from { −<!-- − --> 1 , 0 , 1 } n with P r ( ε<!-- ε --> i = −<!-- − --> 1 ) = P r ( ε<!-- ε --> i = 1 ) = p and ε<!-- ε --> i ’s chosen independently.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Associative recall of memory without errors
Kanter, I., & Sompolinsky, H. (1987) · Physical Review A · doi:10.1103/physreva.35.380 · Cited by 379 · cited 2×
“geometry (Füredi [4]), threshold logic (Zuev [27]), and associative memories (Kanter-Sompolinsky [11]).”
Background
Cited by
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
The Littlewood–Offord problem and invertibility of random matrices
Rudelson, M., & Vershynin, R. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.01.010 · Cited by 322
Non-asymptotic Theory of Random Matrices: Extreme Singular Values
Rudelson, M., & Vershynin, R. (2011) · Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) · doi:10.1142/9789814324359_0111 · Cited by 296
Metadata
- Authors
- Kahn, J., Komlós, J., & Szemerédi, E.
- Venue
- Journal of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1995
- Volume
- 8
- Issue
- 1
- Pages
- 223-240
- ISSN
- 0894-0347 (ISSN-L)
- 1088-6834
- OpenAlex
- W2066513831
- Cited by
- 158
- References
- 1
- FWCI
- 1.65
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the probability that a random ±1-matrix is singular. https://app.cochat.ai/papers/10.1090/s0894-0347-1995-1260107-2
- The paper
- Kahn, J., Komlós, J., & Szemerédi, E. (1995). On the probability that a random ±1-matrix is singular. Journal of the American Mathematical Society. https://doi.org/10.1090/s0894-0347-1995-1260107-2
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.