Szemerédi's theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Szemerédi's theorem" in English language version.

Global rank English rank

34ams.org

451^st place

277^th place

32doi.org

2^nd place

17semanticscholar.org

11^th place

8^th place

17arxiv.org

69^th place

59^th place

6zbmath.org

1,923^rd place

1,068^th place

3harvard.edu

18^th place

17^th place

2nih.gov

4^th place

1renyi.hu

1icm.edu.pl

2,656^th place

5,310^th place

1cam.ac.uk

670^th place

480^th place

1combinatorics.org

1quantamagazine.org

6,413^th place

4,268^th place

1emory.edu

4,363^rd place

2,801^st place

1handle.net

102^nd place

76^th place

ams.org

arxiv.org

Tao, Terence (2007). "The dichotomy between structure and randomness, arithmetic progressions, and the primes". In Sanz-Solé, Marta; Soria, Javier; Varona, Juan Luis; Verdera, Joan (eds.). Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006. International Congress of Mathematicians. Vol. 1. Zürich: European Mathematical Society. pp. 581–608. arXiv:math/0512114. doi:10.4171/022-1/22. ISBN 978-3-03719-022-7. MR 2334204.
O'Bryant, Kevin (2011). "Sets of integers that do not contain long arithmetic progressions". Electronic Journal of Combinatorics. 18 (1). arXiv:0811.3057. doi:10.37236/546. MR 2788676.
Elkin, Michael (2011). "An improved construction of progression-free sets". Israel Journal of Mathematics. 184 (1): 93–128. arXiv:0801.4310. doi:10.1007/s11856-011-0061-1. MR 2823971.
Green, Ben; Wolf, Julia (2010). "A note on Elkin's improvement of Behrend's construction". In Chudnovsky, David; Chudnovsky, Gregory (eds.). Additive Number Theory. Additive number theory. Festschrift in honor of the sixtieth birthday of Melvyn B. Nathanson. New York: Springer. pp. 141–144. arXiv:0810.0732. doi:10.1007/978-0-387-68361-4_9. ISBN 978-0-387-37029-3. MR 2744752. S2CID 10475217.
Sanders, Tom (2011). "On Roth's theorem on progressions". Annals of Mathematics. 174 (1): 619–636. arXiv:1011.0104. doi:10.4007/annals.2011.174.1.20. MR 2811612. S2CID 53331882.
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.03528v2 [math.NT].
Bloom, Thomas F.; Sisask, Olof (2023). "An improvement to the Kelley-Meka bounds on three-term arithmetic progressions". arXiv:2309.02353v1 [math.NT].
Kelley, Zander; Meka, Raghu (2023). "Strong Bounds for 3-Progressions". arXiv:2302.05537v5 [math.NT].
Green, Ben; Tao, Terence (2009). "New bounds for Szemeredi's theorem. II. A new bound for r₄(N)". In Chen, William W. L.; Gowers, Timothy; Halberstam, Heini; Schmidt, Wolfgang; Vaughan, Robert Charles (eds.). New bounds for Szemeredi's theorem, II: A new bound for r_4(N). Analytic number theory. Essays in honour of Klaus Roth on the occasion of his 80th birthday. Cambridge: Cambridge University Press. pp. 180–204. arXiv:math/0610604. Bibcode:2006math.....10604G. ISBN 978-0-521-51538-2. MR 2508645. Zbl 1158.11007.
Green, Ben; Tao, Terence (2017). "New bounds for Szemerédi's theorem, III: A polylogarithmic bound for r₄(N)". Mathematika. 63 (3): 944–1040. arXiv:1705.01703. doi:10.1112/S0025579317000316. MR 3731312. S2CID 119145424.
Leng, James; Sah, Ashwin; Sawhney, Mehtaab (2024). "Improved Bounds for Szemerédi's Theorem". arXiv:2402.17995 [math.CO].
Leng, James; Sah, Ashwin; Sawhney, Mehtaab (2023). "Improved bounds for five-term arithmetic progressions". arXiv:2312.10776 [math.NT].
Gowers, Timothy (2007). "Hypergraph regularity and the multidimensional Szemerédi theorem". Annals of Mathematics. 166 (3): 897–946. arXiv:0710.3032. doi:10.4007/annals.2007.166.897. MR 2373376. S2CID 56118006.
Tao, Terence (2006). "A variant of the hypergraph removal lemma". Journal of Combinatorial Theory. Series A. 113 (7): 1257–1280. arXiv:math/0503572. doi:10.1016/j.jcta.2005.11.006. MR 2259060.
Conlon, David; Fox, Jacob; Zhao, Yufei (2015). "A relative Szemerédi theorem". Geometric and Functional Analysis. 25 (3): 733–762. arXiv:1305.5440. doi:10.1007/s00039-015-0324-9. MR 3361771. S2CID 14398869.
Zhao, Yufei (2014). "An arithmetic transference proof of a relative Szemerédi theorem". Mathematical Proceedings of the Cambridge Philosophical Society. 156 (2): 255–261. arXiv:1307.4959. Bibcode:2014MPCPS.156..255Z. doi:10.1017/S0305004113000662. MR 3177868. S2CID 119673319.

cam.ac.uk

combinatorics.org

doi.org

emory.edu

handle.net

harvard.edu

icm.edu.pl

nih.gov

quantamagazine.org

Sloman, Leila (2024-08-05). "Grad Students Find Inevitable Patterns in Big Sets of Numbers". Quanta Magazine. Retrieved 2024-08-07.

renyi.hu

semanticscholar.org

zbmath.org

Szemerédi's theorem (English Wikipedia)

ams.org

mathscinet.ams.org

arxiv.org

cam.ac.uk

dpmms.cam.ac.uk

combinatorics.org

doi.org

emory.edu

math.emory.edu

handle.net

hdl.handle.net

harvard.edu

ui.adsabs.harvard.edu

icm.edu.pl

matwbn.icm.edu.pl

nih.gov

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

quantamagazine.org

renyi.hu

semanticscholar.org

api.semanticscholar.org

zbmath.org