An upper bound for \(B_2 [2]\) sequences (Q1971018): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.1999.3012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091997941 / rank | |||
Normal rank | |||
Revision as of 19:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for \(B_2 [2]\) sequences |
scientific article |
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
