Elekes–Ruzsa conjecture on product sets of small-doubling sets

Let d4a0\be\bbZd4a0\be\bb Z be a finite set. Its sumset is d4a0+d4a0=a+a:a,ad4a0d4a0+d4a0=a+a':a,a'd4a0. Here X\buildrelYX\buildrel\ll\over\leq Y denotes that XX is at most a constant multiple of YY.

Elekes–Ruzsa conjecture. If

d4a0+d4a0d4a0,|d4a0+d4a0|\ll|d4a0|,

then

d4a0\cdotd4a0d4a02(logd4a0)12log2o(1).|d4a0\cdotd4a0|\geq|d4a0|^2(\log|d4a0|)^{1-2\log 2-o(1)}.

This conjecture concerns the difficult direction of the sum-product phenomenon for sets with bounded additive doubling. The paper describes it as still open and proves results for arithmetic progressions and related settings.

Sources & referencesView supporting material

Primary source

Max Wenqiang Xu and Yunkun Zhou, “On product sets of arithmetic progressions”, arXiv:2201.00104 (2023).

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.