Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polynomials vanishing on Cartesian products: The Elekes-Szabó Theorem revisited (1504.05012v1)

Published 20 Apr 2015 in math.CO

Abstract: Let $F\in\mathbb{C}[x,y,z]$ be a constant-degree polynomial,and let $A,B,C\subset\mathbb C$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n{11/6})$ points of the Cartesian product $A\times B\times C$, unless $F$ has a special group-related form. This improves a theorem of Elekes and Szab\'o [Combinatorica, 2012], and generalizes a result of Raz, Sharir, and Solymosi [Amer. J. Math., to appear]. The same statement holds over $\mathbb{R}$, and a similar statement holds when $A, B, C$ have different sizes (with a more involved bound replacing $O(n{11/6})$). This result provides a unified tool for improving bounds in various Erd\H os-type problems in combinatorial geometry, and we discuss several applications of this kind.

Summary

We haven't generated a summary for this paper yet.