Every function is the representation function of an additive basis for the integers

zbMATH Open1133.11005arXivmath/0302091MaRDI QIDQ1780141FDOQ1780141

Publication date: 7 June 2005

Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Abstract: Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 leq a_2 leq ... leq a_h. The function r_{A,h}: Z o N_0 cup infty is the representation function of order h for A. The set A is called an asymptotic basis of order h if r_{A,h}^{-1}(0) is finite, that is, if every integer with at most a finite number of exceptions can be represented as the sum of exactly h not necessarily distinct elements of A. It is proved that every function is a representation function, that is, if f: Z o N_0 cup infty is any function such that f^{-1}(0) is finite, then there exists a set A of integers such that f(n) = r_{A,h}(n) for all n in Z. Moreover, the set A can be arbitrarily sparse in the sense that, if phi(x) o infty, then there exists a set A with f(n) = r_{A,h}(n) such that card{a in A : |a| leq x} < phi(x) for all sufficiently large x.

Full work available at URL: https://arxiv.org/abs/math/0302091

Recommendations

zbMATH Keywords

representation functions additive bases

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Representation functions (11B34)

Cited In (14)

This page was built for publication: Every function is the representation function of an additive basis for the integers

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