Search arXivSearch

arXiv · 2511.04233

Improved bound for the $k$-variate Elekes--Rónyai theorem

Abstract

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ 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 $A_1\times \cdots\times A_k$ under $f$. Extending a theorem of Elekes and Rónyai, which deals with the case $k=2$, and a result of Raz, Sharir, and De Zeeuw, dealing with the case $k=3$, it was proved Raz and Shem Tov, that for every choice of finite $A_1,\ldots, A_k\subset \mathbb{R}$, each of size $n$, one has \begin{equation}\label{RSbound} |f(A_1,\ldots,A_k)|=Ω(n^{3/2}), \end{equation} unless $f$ has some degenerate special form. In this paper, we introduce the notion of a {\it rank} of a $k$-variate polynomial $f$, denoted as ${\rm rank}(f)$. Letting $r={\rm rank}(f)$, we prove that \begin{equation} |f(A_1,\ldots,A_k)|=Ω\left(n^{\frac{5r-4}{2r}-\varepsilon}\right), \end{equation} for every $\varepsilon>0$, where the constant of proportionality depends on $\varepsilon$ and on ${\rm deg}(f)$. This improves the previous lower bound, for polynomials $f$ for which ${\rm rank}(f)\ge 3$. We present an application of our main result, to lower bound the number of distinct $d$-volumes spanned by $(d+1)$-tuples of points lying on the moment curve in $\mathbb{R}^d$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaara Jahn, Orit E. Raz. 2025-11-06. Improved bound for the $k$-variate Elekes--Rónyai theorem. https://arxiv.org/abs/2511.04233

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO