An upper bound for B2[g] sets Original Research Article

Suppose g is a fixed positive integer. For Ngreater-or-equal, slanted2, a set image is called a B2[g] set if every integer n has at most g distinct representations as n=a+b with image and aless-than-or-equals, slantb. In this paper, we give an upper bound estimate for the size of such image, improving the existing results.