A weak polynomial Freiman–Ruzsa conjecture
A weak polynomial Freiman–Ruzsa conjecture
Let be a -module, and let be a finite set satisfying
for some .
Weak polynomial Freiman–Ruzsa conjecture. There is an absolute constant such that one can find with
and elements for some satisfying
This is a weaker version of the polynomial Freiman–Ruzsa conjecture, which seeks quantitatively optimal dependence on the doubling constant 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.