Εικασία Έρντος για τις αριθμητικές προόδους (Greek Wikipedia)
Analysis of information sources in references of the Wikipedia article "Εικασία Έρντος για τις αριθμητικές προόδους" in Greek language version.
refsWebsite
Global rank
Greek rank
low place
low place
6,413th place
low place
5th place
8th place
ams.org (Global: 451st place; Greek: 2,456th place)
- 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. doi:. .
arxiv.org (Global: 69th place; Greek: 279th place)
- Ben J. Green et Terence Tao, « The primes contain arbitrarily long arithmetic progressions », Annals of Mathematics, vol. 167, 2008, p. 481-547 (arXiv math.NT/0404188).
- Bloom, Thomas F.; Sisask, Olof (2020). «Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions». .
- Kelley, Zander· Meka, Raghu (6 Νοεμβρίου 2023). «Strong Bounds for 3-Progressions». 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. σελίδες 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». .
- Bloom, Thomas F.; Sisask, Olof (2023-09-05). «An improvement to the Kelley-Meka bounds on three-term arithmetic progressions». .
doi.org (Global: 2nd place; Greek: 3rd place)
dx.doi.org
- Erdős, Paul; Turán, Paul (1936), «On some sequences of integers», Journal of the London Mathematical Society 11 (4): 261–264, doi:, http://www.renyi.hu/~p_erdos/1936-05.pdf.
- 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. doi:. .
- 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. doi:. ISSN 2834-4634. https://msp.org/ent/2023/2-1/p02.xhtml.
- 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. doi:.
doi.org
- Kelley, Zander· Meka, Raghu (6 Νοεμβρίου 2023). «Strong Bounds for 3-Progressions». 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. σελίδες 933–973. arXiv:2302.05537 . doi:10.1109/FOCS57990.2023.00059. ISBN 979-8-3503-1894-4.
ieee.org (Global: 652nd place; Greek: 1,609th place)
ieeexplore.ieee.org
- Kelley, Zander· Meka, Raghu (6 Νοεμβρίου 2023). «Strong Bounds for 3-Progressions». 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. σελίδες 933–973. arXiv:2302.05537 . doi:10.1109/FOCS57990.2023.00059. ISBN 979-8-3503-1894-4.
msp.org (Global: low place; Greek: low place)
- 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. doi:. ISSN 2834-4634. https://msp.org/ent/2023/2-1/p02.xhtml.
quantamagazine.org (Global: 6,413th place; Greek: low place)
- Sloman, Leila (21 Μαρτίου 2023). «Surprise Computer Science Proof Stuns Mathematicians». Quanta Magazine (στα Αγγλικά).
renyi.hu (Global: low place; Greek: low place)
- Erdős, Paul; Turán, Paul (1936), «On some sequences of integers», Journal of the London Mathematical Society 11 (4): 261–264, doi:, http://www.renyi.hu/~p_erdos/1936-05.pdf.
wikipedia.org (Global: low place; Greek: low place)
en.wikipedia.org
- Erdős, Paul; Turán, Paul (1936), «On some sequences of integers», Journal of the London Mathematical Society 11 (4): 261–264, doi:, http://www.renyi.hu/~p_erdos/1936-05.pdf.
- p. 354, Soifer, Alexander (2008); The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators; New York: Springer. ISBN 978-0-387-74640-1
worldcat.org (Global: 5th place; Greek: 8th place)
- 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. doi:. ISSN 2834-4634. https://msp.org/ent/2023/2-1/p02.xhtml.