Improved bound for the $k$-variate Elekes--R\'onyai theorem
Yaara Jahn, Orit E. Raz

TL;DR
This paper improves the lower bounds on the size of the image of finite sets under multivariate polynomials, introducing a new notion of polynomial rank to generalize and strengthen previous results in combinatorial geometry.
Contribution
The paper introduces the concept of polynomial rank and establishes a new lower bound on the size of polynomial images, extending prior bounds for higher-rank polynomials.
Findings
New lower bound: |f(A_1,...,A_k)| = Ω(n^{(5r-4)/(2r) - ε}) for polynomials with rank r ≥ 3.
Introduces the notion of polynomial rank to analyze the structure of multivariate polynomials.
Application to bounding the number of distinct volumes spanned by points on the moment curve.
Abstract
Let , for . For any finite sets , consider the set that is, the image of under . Extending a theorem of Elekes and R\'onyai, which deals with the case , and a result of Raz, Sharir, and De Zeeuw, dealing with the case , it was proved Raz and Shem Tov, that for every choice of finite , each of size , one has \begin{equation}\label{RSbound} |f(A_1,\ldots,A_k)|=\Omega(n^{3/2}), \end{equation} unless has some degenerate special form. In this paper, we introduce the notion of a {\it rank} of a -variate polynomial , denoted as . Letting , we prove that \begin{equation}…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Limits and Structures in Graph Theory · Functional Equations Stability Results
