English

Improved Elekes-Szab\'o type estimates using proximity

Combinatorics 2024-02-27 v1 Computational Geometry

Abstract

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product A×B×CA\times B\times C with an algebraic surface {f=0}\{f=0\} over the reals. In particular, if A,B,CA,B,C are sets of NN real numbers and ff is a trivariate polynomial, then either ff has a special form that encodes additive group structure (for example f(x,y,x)=x+yzf(x,y,x) = x + y - z), or A×B×C{f=0}A \times B\times C \cap\{f=0\} has cardinality O(N12/7)O(N^{12/7}). This is an improvement over the previously bound O(N11/6)O(N^{11/6}). We also prove an asymmetric version of our main result, which yields an Elekes-Ronyai type expanding polynomial estimate with exponent 3/23/2. This has applications to questions in combinatorial geometry related to the Erd\H{o}s distinct distances problem. Like previous approaches to the problem, we rephrase the question as a L2L^2 estimate, which can be analyzed by counting additive quadruples. The latter problem can be recast as an incidence problem involving points and curves in the plane. The new idea in our proof is that we use the order structure of the reals to restrict attention to a smaller collection of proximate additive quadruples.

Keywords

Cite

@article{arxiv.2211.13294,
  title  = {Improved Elekes-Szab\'o type estimates using proximity},
  author = {Jozsef Solymosi and Joshua Zahl},
  journal= {arXiv preprint arXiv:2211.13294},
  year   = {2024}
}

Comments

7 pages, 0 figures

R2 v1 2026-06-28T06:42:57.958Z