Additive bases and subadditive functions

Additive bases, including sumsets (11B13) Other combinatorial number theory (11B75) Other results on the distribution of values or the characterization of arithmetic functions (11N64)

Review text

A sequence \(A=\{a_1,a_2,\dots, a_n,\dots\}\) of non-negative integers is called an additive basis if there exists an \(h\) such that any non-negative integer can be expressed as a sum of \(h\) terms of \(A\). The author proves the following result: If the function \(f\) is non-negative bounded subadditive (i.e. \(0\leq f(m+n)\leq f(m)+f(n)\)) then either \(\lim_{a\in A, a\to\infty} f(a)=0\) implies that \(A\) is not a basis or there exists a positive integer \(k\) such that \(\lim_{n\to\infty}f(kn)=0\). This result is connected with the paper of \textit{J. M. Deshouillers, P. Erdős} and \textit{A.Sárközy} [Acta Arith. 30, 121-132 (1976; Zbl 0349.10047)].

Recommendations

Cited in

(4)

This page was built for publication: Additive bases and subadditive functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288891)