Constructions for the Elekes-Szabó and Elekes-Rónyai problems
arXiv:1812.00654
Abstract
We give a construction of a non-degenerate polynomial and a set of cardinality such that , thus providing a new lower bound construction for the Elekes--Szabó problem. We also give a related construction for the Elekes--Rónyai problem restricted to a subgraph. This consists of a polynomial that is not additive or multiplicative, a set of size , and a subset of size on which takes only distinct values.