A Numerical Note on Upper Bounds for B₂[g] Sets

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 1930s when Sidon asked for the maximal size o. subset of consecutive integers with that property. This question is now answered i. satisfactory way. Their natural generalization, called B₂[g] sets and defined by the fact that there are at mos. ways (up to reordering the summands) to represen. given integer a. sum of two elements of the set, is much more difficult to handle and not as well understood. In this article, usin. numerical approach, we improve the best upper estimates on the size o. B₂[g] set in an interval of integers in the case. = 2, 3, 4, and 5.