<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-05T11:58:24Z</responseDate>
  <request identifier="25866" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:25866</identifier>
        <datestamp>2026-06-23T12:59:53Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Improved Bound for the k-Variate Elekes-Rónyai Theorem</dc:title>
          <dc:creator>Jahn, Yaara</dc:creator>
          <dc:creator>Raz, Orit E.</dc:creator>
          <dc:subject>Polynomial Expansion</dc:subject>
          <dc:subject>Elekes-Rónyai theorem</dc:subject>
          <dc:description>Let f ∈ ℝ[x₁,…,x_k], for k ≥ 2. For any finite sets A₁,…,A_k ⊂ ℝ, consider the set f(A₁,…,A_k): = {f(a₁,…,a_k)∣ (a₁,⋯,a_k) ∈ A₁×⋯× A_k}, that is, the image of A₁×⋯×A_k under f. Extending a theorem of Elekes and Rónyai, which deals with the case k = 2, and the result of Raz, Sharir, and De Zeeuw [Raz et al., 2018], dealing with the case k = 3, it is proved in Raz and Shem Tov [Raz and Shem{-}Tov, 2020], that for every choice of finite A₁,…, A_k ⊂ ℝ, each of size n, one has &#13;
(1)  |f(A₁,…,A_k)| = Ω(n^{3/2}), &#13;
unless f has some degenerate special form.&#13;
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 &#13;
(2)  |f(A₁,…,A_k)| = Ω(n^{(5r-4)/2r-ε}) , &#13;
for every ε &gt; 0, where the constant of proportionality depends on ε and on deg(f). This improves the lower bound (1), for polynomials f for which rank(f) ≥ 3.&#13;
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 ℝ^d.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Yaara Jahn and Orit E. Raz</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.SoCG.2026.59</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-258663</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.59</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
