arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.02771math.NT
收藏

关于b ~ 2 [g]集上界的一个数值注记

A numerical note on upper bounds for b 2 [g] sets

Laurent Habsieger, Alain Plagne

摘要:

西顿集是这样的集合,它的两个元素的和永远不重合。他们可以追溯到30年代,当时Sidon要求具有该属性的连续整数子集的最大大小。这个问题现在得到了令人满意的回答。它们的自然推广,称为B 2 [g]集,并定义为最多有g种方法(直到重新排序被加数)将给定整数表示为集合的两个元素之和,这一事实更难以处理,也不容易理解。本文利用数值方法改进了整数区间上B2 [g]集在g = 2,3,4,5情形下的最佳上界估计.

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑