arXiv Analytics

Sign in

arXiv:1001.3356 [math.CO]AbstractReferencesReviewsResources

Equivalence of polynomial conjectures in additive combinatorics

Shachar Lovett

Published 2010-01-19Version 1

We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to functions which locally look like quadratics. In both cases a weak form, with exponential decay of parameters is known, and a strong form with only a polynomial loss of parameters is conjectured. Our main result is that the two conjectures are in fact equivalent.

Related articles: Most relevant | Search more
arXiv:1108.3790 [math.CO] (Published 2011-08-18, updated 2012-10-25)
Additive combinatorics with a view towards computer science and cryptography: An exposition
arXiv:2501.02097 [math.CO] (Published 2025-01-03)
A categorical approach to additive combinatorics
arXiv:2201.04847 [math.CO] (Published 2022-01-13, updated 2022-02-01)
Equivalence Between Four Models of Associahedra