On distinct consecutive differences
classification
🧮 math.CO
math.NT
keywords
consecutivedifferencesdistinctnumbersboundconstantelementsfinite
read the original abstract
We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to the constant multiplier.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.