Local Differences Determined by Convex sets
Preprint
Abstract
This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(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 $D_3(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 $D_4(S)$, namely $|D_4(S)| \geq \frac{5}{4}n -1$. For sufficiently large values of $i$, we are able to prove a non-trivial bound that grows with $i$ using incidence geometry.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- A CONVEX SET WITH A RICH DIFFERENCEActa Mathematica Hungarica, 2022
- An update on the sum-product problemMathematical Proceedings of the Cambridge Philosophical Society, 2021
- Higher Convexity and Iterated Sum SetsCombinatorica, 2021
- Sumsets of semiconvex setsCanadian Mathematical Bulletin, 2021
- Sums, Products, and Dilates on Sparse GraphsSIAM Journal on Discrete Mathematics, 2021
- Sums, products, and ratios along the edges of a graphPublicacions Matemàtiques, 2020
- On Sumsets of Convex SetsCombinatorics, Probability and Computing, 2011
- On Lower Bounds for the L 1-Norm of Exponential SumsMathematical Notes, 2000
- Convexity and SumsetsJournal of Number Theory, 2000