ON MONOTONE INCREASING REPRESENTATION FUNCTIONS

From MaRDI portal



Abstract: Let kge2 be an integer and let A be a set of nonnegative integers. The representation function RA,k(n) for the set A is the number of representations of a nonnegative integer n as the sum of k terms from A. Let A(n) denote the counting function of A.Bell and Shallit recently gave a counterexample for a conjecture of Dombi and proved that if A(n)=o(nfrack−2k−epsilon) for some epsilon>0, then RmathbbNsetminusA,k(n) is eventually strictly increasing. In this paper, we improve this result to A(n)=O(nfrack−2k−1). We also give an example to show that this bound is best possible.











This page was built for publication: ON MONOTONE INCREASING REPRESENTATION FUNCTIONS

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