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

Abstract

We give a construction of a non-degenerate polynomial F∈ R[x,y,z] and a set A of cardinality n such that |Z(F) (A × A × A) | n32, 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 f∈ R[x,y] that is not additive or multiplicative, a set A of size n, and a subset P⊂ A× A of size |P| n3/2 on which f takes only n distinct values.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…