An upper bound for \(B_2 [2]\) sequences (Q1971018)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1421337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for \(B_2 [2]\) sequences |
scientific article; zbMATH DE number 1421337 |
Statements
An upper bound for \(B_2 [2]\) sequences (English)
0 references
7 August 2000
0 references
A sequence \(A\) of integers is said to be a \(B_2[2]\) sequence if for every \(n\), the number of solutions of \(n=a+a', a\leq a', a\in A\) is at most two. Let \(F_2(N,2)=\max\{|A|:A\subset[1,N ]\), \(A\in B_2[2]\}\). In the present paper the author, using a new counting method, proves that \(F(N,2)\leq \sqrt {6N}+1\).
0 references
\(B_2[2]\) sequences
0 references
Sidon sequences
0 references
0.8794976472854614
0 references
0.8196865320205688
0 references
0.8188692331314087
0 references
0.813880980014801
0 references
