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 and a set of cardinality such that , 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 that is not additive or multiplicative, a set of size , and a subset of size on which takes only 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}
}