English

Constructions for the Elekes-Szab\'o and Elekes-R\'onyai problems

Combinatorics 2018-12-04 v1

Abstract

We give a construction of a non-degenerate polynomial FR[x,y,z]F\in \mathbb R[x,y,z] and a set AA of cardinality nn such that Z(F)(A×A×A)n32\left|Z(F)\cap (A \times A \times A) \right| \gg n^{\frac{3}{2}}, thus providing a new lower bound construction for the Elekes--Szab\'o problem. We also give a related construction for the Elekes--R\'onyai problem restricted to a subgraph. This consists of a polynomial fR[x,y]f\in \mathbb R[x,y] that is not additive or multiplicative, a set AA of size nn, and a subset PA×AP\subset A\times A of size Pn3/2|P|\gg n^{3/2} on which ff takes only nn distinct values.

Keywords

Cite

@article{arxiv.1812.00654,
  title  = {Constructions for the Elekes-Szab\'o and Elekes-R\'onyai problems},
  author = {Mehdi Makhul and Oliver Roche-Newton and Audie Warren and Frank de Zeeuw},
  journal= {arXiv preprint arXiv:1812.00654},
  year   = {2018}
}