Local Differences Determined by Convex sets
Abstract
This paper introduces a new problem concerning additive properties of convex sets. Let S= \s1 < … <sn \ be a set of real numbers and let Di(S)= \sx-sy: 1 ≤ x-y ≤ i\. We expect that Di(S) is large, with respect to the size of S and the parameter i, for any convex set S. We give a construction to show that D3(S) can be as small as n+2, 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 D4(S), namely |D4(S)| ≥ 54n -1. For sufficiently large values of i, we are able to prove a non-trivial bound that grows with i using incidence geometry.
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.