Erdős conjecture on arithmetic progressions (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Erdős conjecture on arithmetic progressions" in English language version.

refsWebsite

Global rank English rank

69^th place

59^th place

2^nd place

low place

451^st place

277^th place

11^th place

8^th place

652^nd place

515^th place

6,413^th place

4,268^th place

low place

5^th place

ams.org

Bloom, Thomas F. (2016). "A quantitative improvement for Roth's theorem on arithmetic progressions". Journal of the London Mathematical Society. Second Series. 93 (3): 643–663. arXiv:1405.5800. doi:10.1112/jlms/jdw010. MR 3509957. S2CID 27536138.

Bloom, Thomas F. (2016). "A quantitative improvement for Roth's theorem on arithmetic progressions". Journal of the London Mathematical Society. Second Series. 93 (3): 643–663. arXiv:1405.5800. doi:10.1112/jlms/jdw010. MR 3509957. S2CID 27536138.
Bloom, Thomas F.; Sisask, Olof (2020). "Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions". arXiv:2007.03528 [math.NT].
Kelley, Zander; Meka, Raghu (2023-11-06). "Strong Bounds for 3-Progressions". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 933–973. arXiv:2302.05537. doi:10.1109/FOCS57990.2023.00059. ISBN 979-8-3503-1894-4.
Kelley, Zander; Meka, Raghu (2023-02-10). "Strong Bounds for 3-Progressions". arXiv:2302.05537 [math.NT].
Bloom, Thomas F.; Sisask, Olof (2023-12-31). "The Kelley–Meka bounds for sets free of three-term arithmetic progressions". Essential Number Theory. 2 (1): 15–44. arXiv:2302.07211. doi:10.2140/ent.2023.2.15. ISSN 2834-4634.
Bloom, Thomas F.; Sisask, Olof (2023-02-14). "The Kelley–Meka bounds for sets free of three-term arithmetic progressions". Essential Number Theory. 2: 15–44. arXiv:2302.07211. doi:10.2140/ent.2023.2.15.
Bloom, Thomas F.; Sisask, Olof (2023-09-05). "An improvement to the Kelley-Meka bounds on three-term arithmetic progressions". arXiv:2309.02353 [math.NT].

Erdős, Paul; Turán, Paul (1936), "On some sequences of integers" (PDF), Journal of the London Mathematical Society, 11 (4): 261–264, doi:10.1112/jlms/s1-11.4.261.
Bloom, Thomas F. (2016). "A quantitative improvement for Roth's theorem on arithmetic progressions". Journal of the London Mathematical Society. Second Series. 93 (3): 643–663. arXiv:1405.5800. doi:10.1112/jlms/jdw010. MR 3509957. S2CID 27536138.
Kelley, Zander; Meka, Raghu (2023-11-06). "Strong Bounds for 3-Progressions". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 933–973. arXiv:2302.05537. doi:10.1109/FOCS57990.2023.00059. ISBN 979-8-3503-1894-4.
Bloom, Thomas F.; Sisask, Olof (2023-12-31). "The Kelley–Meka bounds for sets free of three-term arithmetic progressions". Essential Number Theory. 2 (1): 15–44. arXiv:2302.07211. doi:10.2140/ent.2023.2.15. ISSN 2834-4634.
Bloom, Thomas F.; Sisask, Olof (2023-02-14). "The Kelley–Meka bounds for sets free of three-term arithmetic progressions". Essential Number Theory. 2: 15–44. arXiv:2302.07211. doi:10.2140/ent.2023.2.15.

Kelley, Zander; Meka, Raghu (2023-11-06). "Strong Bounds for 3-Progressions". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 933–973. arXiv:2302.05537. doi:10.1109/FOCS57990.2023.00059. ISBN 979-8-3503-1894-4.

Bloom, Thomas F. (2016). "A quantitative improvement for Roth's theorem on arithmetic progressions". Journal of the London Mathematical Society. Second Series. 93 (3): 643–663. arXiv:1405.5800. doi:10.1112/jlms/jdw010. MR 3509957. S2CID 27536138.