English

An extension of the Erd\H{o}s-Tetali theorem

Combinatorics 2024-12-18 v2 Number Theory

Abstract

Given a sequence A={a0<a1<a2}N\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}, let rA,h(n)r_{\mathscr{A},h}(n) denote the number of ways nn can be written as the sum of hh elements of A\mathscr{A}. Fixing h2h\geq 2, we show that if ff is a suitable real function (namely: locally integrable, OO-regularly varying and of positive increase) satisfying x1/hlog(x)1/hf(x)x1/(h1)log(x)ε for some ε>0, x^{1/h}\log(x)^{1/h} \ll f(x) \ll \frac{x^{1/(h-1)}}{\log(x)^{\varepsilon}} \text{ for some } \varepsilon > 0, then there must exist AN\mathscr{A}\subseteq\mathbb{N} with A[0,x]=Θ(f(x))|\mathscr{A}\cap [0,x]|=\Theta(f(x)) for which rA,h+(n)=Θ(f(n)h+/n)r_{\mathscr{A},h+\ell}(n) = \Theta(f(n)^{h+\ell}/n) for all 0\ell \geq 0. Furthermore, for h=2h=2 this condition can be weakened to x1/2log(x)1/2f(x)xx^{1/2}\log(x)^{1/2} \ll f(x) \ll 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.

Keywords

Cite

@article{arxiv.1807.10200,
  title  = {An extension of the Erd\H{o}s-Tetali theorem},
  author = {Christian Táfula},
  journal= {arXiv preprint arXiv:1807.10200},
  year   = {2024}
}

Comments

41 pages