Equivalence of polynomial conjectures in additive combinatorics

Details Equivalence of polynomial conjectures in additive combinatorics Equivalence of polynomial conjectures in additive combinatorics

2010-01-19

arxiv.org/abs/1001.3356v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Equivalence of polynomial conjectures in additive combinatorics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Equivalence of polynomial conjectures in additive combinatorics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equivalence of polynomial conjectures in additive combinatorics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636833