ON THE SIZE OF FINITE SIDON SEQUENCES

被引：13

作者：

CHEN, S

机构：

来源：

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 1994年 / 121卷 / 02期

关键词：

ADDITIVE NUMBER THEORY; DIFFERENCE SETS; B(H)-SEQUENCE; SIDON SEQUENCES;

D O I：

10.2307/2160407

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let h greater-than-or-equal-to 2 be an integer. A set of positive integers B is called a B(h)-sequence, or a Sidon sequence of order h, if all sums a1 + a2 + ... + a(h), where a(i) is-an-element-of B (i = 1, 2, ..., h) , are distinct up to rearrangements of the summands. Let F(h)(n) be the size of the maximum B(h)-sequence contained in {1, 2, ..., n] . We prove that F2r-1(n) less-than-or-equal-to ((r!)2n)1/(2r-1) + O(n1/(4r-2)).

引用

页码：353 / 356

页数：4