Construction of a point-line incidence problem over the reals with constant randomized CC but linear deterministic CC with equality oracle, improving prior separations.
The sum-product conjecture is false for real numbers
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
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.
years
2026 6verdicts
UNVERDICTED 6representative citing papers
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.
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 via prime-splitting amplification.
Constructs lattice point sets with many rectangles and few isosceles triangles to produce explicit counterexamples to the Mizohata-Takeuchi conjecture for the paraboloid via transference principles.
Proves |f(A)| <= |A|^{k-c} for monic degree-k polynomials f in the Minkowski sum-product sense, including a bound for AA+A.
Adapts known construction to prove existence of c>0 and large finite A subset R with |AA+A+A| << |A|^{2-c}, plus corollaries for other sum-product expressions.
citing papers explorer
-
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.
-
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 via prime-splitting amplification.
-
More sum-product type counterexamples: products with shifts and $AA+A$
Adapts known construction to prove existence of c>0 and large finite A subset R with |AA+A+A| << |A|^{2-c}, plus corollaries for other sum-product expressions.