An upper bound for B₂ [2] sequences

DOI10.1006/JCTA.1999.3012MaRDI QIDQ1971018zbMATH OpenOpenAlexFDO

Authors Javier Cilleruelo

Publication date 7 August 2000

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcta.1999.3012

zbMATH Keywords

\(B_2[2\) sequences]Sidon sequences

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Other combinatorial number theory (11B75)

Review text

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\).

Recommendations

• An inequality for B2-sequences
• A new upper bound for \(B_2 [2]\) sets
• Binary \(B_2\)-sequences: a new upper bound
• On $B_{2k}$-sequences

Cites work

• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• The density of \(B_ h[g]\) sequences and the minimum of dense cosine sums
• Upper and lower bounds for finite \(B_h[g]\) sequences.

Cited in

(14)

• A remark on \(B_{2k}\)-sequences
• B₂-sequences and the distinct distance constant
• Generalized Sidon sets
• scientific article; zbMATH DE number 4208147 (Why is no real title available?)
• $B_{2}$-sequences whose terms are squares
• B₂[∞]-sequences of square numbers
• B _h [ g ] sequences
• A remark on B₂-sequences in GF[p,x]
• A B 2 -Sequence with Larger Reciprocal Sum
• An inequality for B2-sequences
• A new upper bound for \(B_2 [2]\) sets
• Binary \(B_2\)-sequences: a new upper bound
• An upper bound for \(B_{2}[g]\) sets
• Sidon sets in \(\mathbb N^d\)

This page was built for publication: An upper bound for \(B_2 [2]\) sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971018)