The sum-product conjecture is false for real numbers
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Communication complexity of point-line incidences over the reals
A new point-line incidence problem over the reals achieves constant randomized communication complexity but linear deterministic communication complexity even with equality oracle, improving prior separations.
-
A combinatorial large sieve for Sidon sets, distances, and norm forms
A new combinatorial large sieve produces the first super-polylogarithmic upper bounds of the form N exp(-c log N / log log N) for Sidon sets in squares and no-repeated-distance sets in the grid.
-
Both $AA$ and $(A+1)(A+1)$ can be small
There exist arbitrarily large finite sets A of reals such that max{|AA|, |(A+1)(A+1)|} ≪ |A|^{2-c} for some c>0.
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.