An extension of the Erdos-Tetali theorem
Abstract
Given a sequence A=\a0<a1<a2…\⊂eq N, let rA,h(n) denote the number of ways n can be written as the sum of h elements of A. Fixing h≥ 2, we show that if f is a suitable real function (namely: locally integrable, O-regularly varying and of positive increase) satisfying \[ x1/h(x)1/h f(x) x1/(h-1)(x) for some > 0, \] then there must exist A⊂eqN with |A [0,x]|=(f(x)) for which rA,h+(n) = (f(n)h+/n) for all ≥ 0. Furthermore, for h=2 this condition can be weakened to x1/2(x)1/2 f(x) x. The proof is somewhat technical and the methods rely on ideas from regular variation theory, which are presented in an appendix with a view towards the general theory of additive bases. We also mention an application of these ideas to Schnirelmann's method.
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.