Constructs sets A subset R with |{x+y+(x-y)^2 : x,y in A}| <= |A|^{2-c} for some c>0, giving a counterexample to the Elekes-Rónyai problem.
The sum-product conjecture is false for real numbers
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We disprove the sum-product conjecture for real numbers by constructing arbitrarily large $A\subset \mathbb{R}$ (whose elements are algebraic integers in a number field of degree $\asymp \log\lvert A\rvert$) such that \[\max(\lvert A+A\rvert ,\lvert AA\rvert)\leq \lvert A\rvert^{2-c}\] where $c>0$ is an absolute constant. We also disprove the many sums and products conjecture by constructing, for any $k\geq 3$, arbitrarily large $A\subset \mathbb{R}$ such that \[\max(\lvert kA\rvert,\lvert A^{(k)}\rvert)\leq \lvert A\rvert^{C\frac{\log k}{\log\log k}}\] for some constant $C>0$. We obtain similar constructions for $p$-adics, finite fields, and function fields in positive characteristic, and also obtain new lower bounds for the number of solutions to linear equations in a multiplicative group and the number of solutions to the unit equation in sufficiently many variables.
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Split primes and the Elekes-R\'onyai problem
Constructs sets A subset R with |{x+y+(x-y)^2 : x,y in A}| <= |A|^{2-c} for some c>0, giving a counterexample to the Elekes-Rónyai problem.