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

Abstract

Let f∈ R[x1,…, xk], for k 2. For any finite sets A1,…, Ak⊂ R, consider the set f(A1,…, Ak):=\f(a1,…, ak) (a1,·s,ak)∈ A1×·s × Ak\, that is, the image of A1× ·s× Ak under f. Extending a theorem of Elekes and R\'onyai, 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 A1,…, Ak⊂ R, each of size n, one has equationRSbound |f(A1,…,Ak)|=(n3/2), equation unless f has some degenerate special form. In this paper, we introduce the notion of a rank of a k-variate polynomial f, denoted as rank(f). Letting r= rank(f), we prove that equation |f(A1,…,Ak)|=(n5r-42r-), equation for every >0, where the constant of proportionality depends on and on deg(f). This improves the previous lower bound, for polynomials f for which rank(f) 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 Rd.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…