Equivalence of polynomial conjectures in additive combinatorics.

Shachar Lovett

Type: Article

Publication Date: 2010-01-01

Citations: 2

Locations

Electronic colloquium on computational complexity - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Equivalence of polynomial conjectures in additive combinatorics	2012	Shachar Lovett
+	Equivalence of polynomial conjectures in additive combinatorics	2010	Shachar Lovett
+	Equivalence of polynomial conjectures in additive combinatorics	2010	Shachar Lovett
+ PDF Chat	None	2015	Shachar Lovett
+	An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem.	2012	Shachar Lovett
+ PDF Chat	Open problems in additive combinatorics	2007	Ernest S. Croot Vsevolod F. Lev
+	Additive Combinatorics: A Menu of Research Problems	2017	Béla Bajnok
+	A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space	2016	Shachar Lovett Oded Regev
+	A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space	2016	Shachar Lovett Oded Regev
+ PDF Chat	Ramsey problems in additive number theory	1993	Béla Bollobás Paul Erdős Guoping Jin
+	Interplay of multiplicative number theory and additive combinatorics	2022
+	Stability results in additive combinatorics and graph theory	2015	Simão Herdade
+	STABILITY RESULTS IN ADDITIVE COMBINATORICS AND GRAPH THEORY	2015	Endre Szemer
+ PDF Chat	On Additive Doubling and Energy	2010	Nets Hawk Katz Paul Koester
+ PDF Chat	A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space	2017	Shachar Lovett Oded Regev
+	Additive Combinatorics: A Menu of Research Problems	2018	Béla Bajnok
+	New bounds in the Bogolyubov-Ruzsa lemma	2023	Tomasz Kosciuszko Tomasz Schoen
+	Additive combinatorics and number theory	2020	Jaroslav Hančl
+	Additive Combinatorics	2006	Terence Tao Van H. Vu
+	Extremal Results in and out of Additive Combinatorics	2020	Andrei Cosmin Pohoata

Works That Cite This (2)

Action	Title	Year	Authors
+	An additive combinatorics approach to the log-rank conjecture in communication complexity	2011	Eli Ben‐Sasson Shachar Lovett Noga Ron‐Zewi
+	An additive combinatorics approach to the log-rank conjecture in communication complexity	2011	Eli Ben‐Sasson Shachar Lovett Noga Ron‐Zewi

Works Cited by This (9)

Action	Title	Year	Authors
+ PDF Chat	AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM	2008	Ben Green Terence Tao
+	Finite field models in additive combinatorics	2005	Ben Green
+ PDF Chat	Inverse conjecture for the gowers norm is false	2008	Shachar Lovett Roy Meshulam Alex Samorodnitsky
+ PDF Chat	Freiman's Theorem in Finite Fields via Extremal Set Theory	2009	Ben Green Terence Tao
+ PDF Chat	SETS WITH SMALL SUMSET AND RECTIFICATION	2006	Ben Green Imre Z. Ruzsa
+	A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four	1998	W. T. Gowers
+	The distribution of polynomials over finite fields, with applications to the Gowers norms	2009	Ben Joseph Green Terence Tao
+ PDF Chat	An equivalence between inverse sumset theorems and inverse conjectures for the<i>U</i><sup>3</sup>norm	2010	Ben Green Terence Tao
+ PDF Chat	Low-degree tests at large distances	2007	Alex Samorodnitsky