New bounds for Szemerédi's theorem, III: A polylogarithmic bound for $r_4(N)$

Ben Green, Terence Tao

Type: Preprint

Publication Date: 2017-01-01

Citations: 2

DOI: https://doi.org/10.48550/arxiv.1705.01703

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View
arXiv (Cornell University) - View
DataCite API - View
arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	New bounds for Szemeredi's theorem, II: A new bound for $r_4(N)$	2006	Ben Green Terence Tao
+ PDF	NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR	2017	Ben Green Terence Tao
+	A Constructive Lower Bound on Szemerédi's Theorem	2017	Vladislav Taranchuk
+ PDF Chat	ON A GENERALIZATION OF SZEMERÉDI'S THEOREM	2006	Ilya D. Shkredov
+	Better bound for the Erdős-Szekeres number	2021	Imre BÃ¡rÃ¡ny
+	On a Generalization of Szemeredi's Theorem	2005	Ilya D. Shkredov
+	New bounds in Balog-Szemerédi-Gowers theorem	2014	Tomasz Schoen
+	New bounds for Szemeredi's theorem, Ia: Progressions of length 4 in finite field geometries revisited	2012	Ben Green Terence Tao
+	A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four	1998	W. T. Gowers
+	Bourgain-Chang's proof of the weak Erdős-Szemerédi conjecture	2017	Dmitrii Zhelezov
+ PDF Chat	New lower bounds for $r_3(N)$	2024	Zach Hunter
+	A new proof of Szemerédi's theorem	2001	W. T. Gowers
+ PDF	An improved lower bound related to the Furstenberg-Sárközy theorem	2015	Mark Lewko
+	Bourgain-Chang's proof of the weak Erd\H{o}s-Szemer\'edi conjecture	2017	Dmitrii Zhelezov
+ PDF	Logarithmic bounds for Roth's theorem via almost-periodicity	2019	Thomas F. Bloom Olof Sisask
+ PDF Chat	New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries	2008	Ben Green Terence Tao
+	Lower bounds in the polynomial Szemerédi theorem	2019	Khalid Younis
+ PDF	On Erdős and Sárközy’s sequences with Property P	2016	Christian Elsholtz Stefan Planitzer
+	A new upper bound for sets with no square differences	2020	Thomas F. Bloom James E. Maynard
+	A generalization of sets without long arithmetic progressions based on Szekeres algorithm	2013	Xiaodong Xu

Works That Cite This (2)

Action	Title	Year	Authors
+	A Constructive Lower Bound on Szemerédi's Theorem	2017	Vladislav Taranchuk
+ PDF Chat	Szemerédi's Theorem in the Primes	2018	Luka Rimanić Julia Wolf

Works Cited by This (22)

Action	Title	Year	Authors
+ PDF	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi
+	A Note on Elkin’s Improvement of Behrend’s Construction	2010	Ben Green Julia Wolf
+	On sets of integers not containing long arithmetic progressions	2001	Izabella Łaba Michael T. Lacey
+	On Triples in Arithmetic Progression	1999	Jean Bourgain
+	Ten Lectures on the Interface between Analytic Number Theory and Harmonic Analysis	1994	Hugh L. Montgomery
+	Irregularities of sequences relative to arithmetic progressions	1967	K. F. Roth
+ PDF Chat	John-type theorems for generalized arithmetic progressions and iterated sumsets	2008	Terence Tao Van Vu
+	Integer Sets Containing No Arithmetic Progressions	1987	D. R. Heath‐Brown
+	Roth’s theorem on progressions revisited	2008	Jean Bourgain
+ PDF	The primes contain arbitrarily long polynomial progressions	2008	Terence Tao Tamar Ziegler