A weak polynomial Freiman–Ruzsa conjecture

Let VV be a Z\mathbb{Z}-module, and let AVA\subseteq V be a finite set satisfying

A+AKA|A+A|\leq K|A|

for some K1K\geq 1.

Weak polynomial Freiman–Ruzsa conjecture. There is an absolute constant c>0c>0 such that one can find A1AA_1\subseteq A with

A1>A/Kc|A_1|>|A|/K^c

and elements ξ1,,ξdV\xi_1,\dots,\xi_d\in V for some d<clog2Kd<c\log 2K satisfying

A1Zξ1++Zξd.A_1\subseteq \mathbb{Z}\xi_1+\dots+\mathbb{Z}\xi_d.

This is a weaker version of the polynomial Freiman–Ruzsa conjecture, which seeks quantitatively optimal dependence on the doubling constant KK in Freiman's theorem. The surrounding discussion presents it as a central open problem in additive combinatorics with applications to the sum-product problem; no resolution of this weaker formulation is given here.

Sources & referencesView supporting material

Primary source

Akshat Mudgal, “An Elekes-Rónyai theorem for sets with few products”, arXiv:2308.04191 (2023).

Additional references

2 papers in this index state this conjecture (2020–2023). The statement above is taken from the most recent of them; the others are arXiv:2003.04648.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.