Growth in Sumsets of Higher Convex Functions

Abstract

The main results of this paper concern growth in sums of a k-convex function f. Firstly, we streamline the proof of a growth result for f(A) where A has small additive doubling, and improve the bound by removing logarithmic factors. The result yields an optimal bound for \[ |2k f(A) - (2k-1)f(A)|. \] We also generalise a recent result of Hanson, Roche-Newton and Senger, by proving that for any finite A⊂ R \[ | 2k f(sA-sA) - (2k-1) f(sA-sA)| s |A|2s \] where s = k+12. This allows us to prove that, given any natural number s ∈ N, there exists m = m(s) such that if A ⊂ R, then equationconj A-Aus |(sA-sA)(m)| s |A|s. equation This is progress towards a conjecture which states that the above inequality can be replaced with \[|(A-A)(m)| s |A|s.\] Developing methods of Solymosi, and Bloom and Jones, we present some new sum-product type results in the complex numbers C and in the function field Fq((t-1)).

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…