English

Improved bound for the $k$-variate Elekes--R\'onyai theorem

Combinatorics 2025-11-07 v1

Abstract

Let fR[x1,,xk]f\in \mathbb{R}[x_1,\ldots, x_k], for k2k\ge 2. For any finite sets A1,,AkRA_1,\ldots, A_k\subset \mathbb{R}, consider the set f(A1,,Ak):={f(a1,,ak)(a1,,ak)A1××Ak}, f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, that is, the image of A1××AkA_1\times \cdots\times A_k under ff. Extending a theorem of Elekes and R\'onyai, which deals with the case k=2k=2, and a result of Raz, Sharir, and De Zeeuw, dealing with the case k=3k=3, it was proved Raz and Shem Tov, that for every choice of finite A1,,AkRA_1,\ldots, A_k\subset \mathbb{R}, each of size nn, one has \begin{equation}\label{RSbound} |f(A_1,\ldots,A_k)|=\Omega(n^{3/2}), \end{equation} unless ff has some degenerate special form. In this paper, we introduce the notion of a {\it rank} of a kk-variate polynomial ff, denoted as rank(f){\rm rank}(f). Letting r=rank(f)r={\rm rank}(f), we prove that \begin{equation} |f(A_1,\ldots,A_k)|=\Omega\left(n^{\frac{5r-4}{2r}-\varepsilon}\right), \end{equation} for every ε>0\varepsilon>0, where the constant of proportionality depends on ε\varepsilon and on deg(f){\rm deg}(f). This improves the previous lower bound, for polynomials ff for which rank(f)3{\rm rank}(f)\ge 3. We present an application of our main result, to lower bound the number of distinct dd-volumes spanned by (d+1)(d+1)-tuples of points lying on the moment curve in Rd\mathbb{R}^d.

Keywords

Cite

@article{arxiv.2511.04233,
  title  = {Improved bound for the $k$-variate Elekes--R\'onyai theorem},
  author = {Yaara Jahn and Orit E. Raz},
  journal= {arXiv preprint arXiv:2511.04233},
  year   = {2025}
}