Table of Contents
Fetching ...

A symmetric multivariate Elekes-Rónyai theorem

Yewen Sun

TL;DR

This work addresses expansion phenomena for multivariate polynomials by proving a symmetric Elekes–Rónyai-type bound in higher dimensions on diagonal inputs, with a precise dichotomy: either significant growth $|P(A,\dots,A)|$ occurs or $P$ has a constrained additive or multiplicative decomposition tied to equivalence relations among inner polynomials. It also extends Erdős–Szemerédi-type results to higher dimensions for pairs of polynomials, establishing near-optimal growth in a broad setting. The proofs synthesize incidence geometry (via Szemerédi–Trotter for curves), algebraic geometry tools (resultants, Bézout, irreducibility), and a generalized Elekes–Nathanson–Ruzsa strategy, yielding a versatile framework for polynomial expansion. Overall, the paper broadens the symmetric Elekes–Rónyai theory to arbitrary dimensions, offering new sum-product-type bounds and structural classifications with potential implications for related combinatorial and geometric problems.

Abstract

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ δ$ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and any finite set $A \subset \mathbb{R}$ of size $n$, our first result shows that \[ |P(A, A, \dots, A)| \gg_δ n^{\frac{3}{2} - \frac{1}{2^{d-t+2}}}, \] unless \begin{align*} &P(x_1, x_2, \dots, x_d) = f\big( u_1(x_1) + u_2(x_2) + \cdots + u_d(x_d) \big) \quad \text{or } &P(x_1, x_2, \dots, x_d) = f\big( v_1(x_1) v_2(x_2) \cdots v_d(x_d) \big), \end{align*} where $f$, $u_i$, and $v_i$ are nonconstant univariate polynomials over $\mathbb{R}$, and there exists an index subset $I \subseteq [d]$ with $|I| = t$ such that for any $i, j \in I$, we have $u_i = λ_{ij} u_j$ (in the additive case) or $|v_i|= |v_j|^{κ_{ij}}$ (in the multiplicative case) for some constants $λ_{ij}\in \mathbb{R}^{\neq 0},κ_{ij}\in\mathbb{Q}^{+}$. This result generalizes the symmetric Elekes-Rónyai theorem proved by Jing, Roy, and Tran. Our second result is a generalized Erdős-Szemerédi theorem for two polynomials in higher dimensions, generalizing another theorem by Jing, Roy, and Tran. A key ingredient in our proofs is a variation of a theorem by Elekes, Nathanson, and Ruzsa.

A symmetric multivariate Elekes-Rónyai theorem

TL;DR

This work addresses expansion phenomena for multivariate polynomials by proving a symmetric Elekes–Rónyai-type bound in higher dimensions on diagonal inputs, with a precise dichotomy: either significant growth occurs or has a constrained additive or multiplicative decomposition tied to equivalence relations among inner polynomials. It also extends Erdős–Szemerédi-type results to higher dimensions for pairs of polynomials, establishing near-optimal growth in a broad setting. The proofs synthesize incidence geometry (via Szemerédi–Trotter for curves), algebraic geometry tools (resultants, Bézout, irreducibility), and a generalized Elekes–Nathanson–Ruzsa strategy, yielding a versatile framework for polynomial expansion. Overall, the paper broadens the symmetric Elekes–Rónyai theory to arbitrary dimensions, offering new sum-product-type bounds and structural classifications with potential implications for related combinatorial and geometric problems.

Abstract

We consider a polynomial of degree that depends non-trivially on each of with . For any integer with , any natural number , and any finite set of size , our first result shows that unless \begin{align*} &P(x_1, x_2, \dots, x_d) = f\big( u_1(x_1) + u_2(x_2) + \cdots + u_d(x_d) \big) \quad \text{or } &P(x_1, x_2, \dots, x_d) = f\big( v_1(x_1) v_2(x_2) \cdots v_d(x_d) \big), \end{align*} where , , and are nonconstant univariate polynomials over , and there exists an index subset with such that for any , we have (in the additive case) or (in the multiplicative case) for some constants . This result generalizes the symmetric Elekes-Rónyai theorem proved by Jing, Roy, and Tran. Our second result is a generalized Erdős-Szemerédi theorem for two polynomials in higher dimensions, generalizing another theorem by Jing, Roy, and Tran. A key ingredient in our proofs is a variation of a theorem by Elekes, Nathanson, and Ruzsa.

Paper Structure

This paper contains 8 sections, 12 theorems, 88 equations.

Key Result

Theorem 1.1

Let $P(x_{1},x_{2},\cdots,x_{d})$ be a polynomial in $\mathbb{R}[x_{1},x_{2},\cdots,x_{d}]$ for some $d\geq 2.$ Assume $P$ has degree $\delta$ and $P$ depends non-trivially on each of $x_1,...,x_d$. For any integer $t$ with $2\leq t\leq d$, $n \in \mathbb{N}$ and finite $A\subset \mathbb{R}$ with $| unless one of the following holds: (i) $P(x_{1},x_{2},\cdots,x_{d})=f( u_{1}(x_{1})+u_{2}(x_{2})+\c

Theorems & Definitions (24)

  • Theorem 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Lemma 2.1
  • proof
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • proof
  • Lemma 3.3
  • ...and 14 more