English

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 S={s1<<sn}S= \{s_1 < \dots <s_n \} be a set of real numbers and let Di(S)={sxsy:1xyi}D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}. We expect that Di(S)D_i(S) is large, with respect to the size of SS and the parameter ii, for any convex set SS. We give a construction to show that D3(S)D_3(S) can be as small as n+2n+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)D_4(S), namely D4(S)54n1|D_4(S)| \geq \frac{5}{4}n -1. For sufficiently large values of ii, we are able to prove a non-trivial bound that grows with ii using incidence geometry.

Keywords

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

R2 v1 2026-06-28T09:46:19.975Z