The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Open accessAbstract
Proceedings of the National Academy of Sciences (PNAS), a peer reviewed journal of the National Academy of Sciences (NAS) - an authoritative source of high-impact, original research that broadly spans the biological, physical, and social sciences.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Salem, R., & Spencer, D. C. (1942) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.28.12.561 · Cited by 134
Cited by
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Multiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28396 · Cited by 632
On the combinatorial problems which I would most like to see solved
Erdős, P. (1981) · Combinatorica · doi:10.1007/bf02579174 · Cited by 313
Erdös, P., Frankl, P., & Rödl, V. (1986) · Graphs and Combinatorics · doi:10.1007/bf01788085 · Cited by 276
A Refined Laser Method and Faster Matrix Multiplication
Alman, J., & Williams, V. V. (2021) · Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611976465.32 · Cited by 268
Improved bound for complexity of matrix multiplication
Davie, A. M., & Stothers, A. J. (2013) · Proceedings of the Royal Society of Edinburgh: Section A Mathematics · doi:10.1017/s0308210511001648 · Cited by 152
On large subsets of $\mathbb{F}_q^n$ with no three-term arithmetic progression
Ellenberg, J., & Gijswijt, D. (2017) · Annals of Mathematics · doi:10.4007/annals.2017.185.1.8 · Cited by 146
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
Metadata
- Authors
- Behrend, F. A.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 1946-12
- Volume
- 32
- Issue
- 12
- Pages
- 331-332
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2023600080
- Cited by
- 408
- References
- 1
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- green
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
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.