Local Differences Determined by Convex sets
Combinatorics
2023-04-04 v1
Abstract
This paper introduces a new problem concerning additive properties of convex sets. Let be a set of real numbers and let . We expect that is large, with respect to the size of and the parameter , for any convex set . We give a construction to show that can be as small as , and show that this is the smallest possible size. On the other hand, we use an elementary argument to prove a non-trivial lower bound for , namely . For sufficiently large values of , we are able to prove a non-trivial bound that grows with using incidence geometry.
Cite
@article{arxiv.2304.00888,
title = {Local Differences Determined by Convex sets},
author = {Krishnendu Bhowmick and Miriam Patry and Oliver Roche-Newton},
journal= {arXiv preprint arXiv:2304.00888},
year = {2023}
}
Comments
9 pages