A new upper bound for \(B_2 [2]\) sets (Q5930029): Difference between revisions

A \(B_2[g]\) set \({\mathcal A}\) is a set of integers such that, for any integer \(n\), \(|\{(a_1,a_2),a_i\in{\mathcal A},\;a_1+a_2=n,\;a_1\leq a_2\}|\leq g\). Thus \(B_2[1]\) sets are Sidon sets. It was shown by \textit{J. Cilleruelo} [ibid. 89, 141--144 (2000; Zbl 0955.11005)] that if \({\mathcal A}\) is a \(B_2 [2]\) set in \(\{1,\dots,N\}\), then \(|{\mathcal A}|\leq(6N)^{1/2}+1\). The present author improves this result, showing that, for sufficiently large \(N\), \(|{\mathcal A}|\leq 2.363584\sqrt N\).