Constructions of generalized Sidon sets.

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Additive bases, including sumsets (11B13) Representation functions (11B34)

Abstract: We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k=s_1+s_2, s_iin S; such sets are called Sidon sets if g=2 and generalized Sidon sets if gge 3. We extend to generalized Sidon sets the Sidon-set constructions of Singer, Bose, and Ruzsa. We also further optimize Koulantzakis' idea of interleaving several copies of a Sidon set, extending the improvements of Cilleruelo & Ruzsa & Trujillo, Jia, and Habsieger & Plagne. The resulting constructions yield the largest known generalized Sidon sets in virtually all cases.

Review text

The authors study sets \(S\subset \mathbb Z\cap [1,n]\) or \(S\subset \mathbb Z_n\) such that every integer (or residue) has at most \(g\) representations as a sum of two elements of \(S\), order of summands taken into account; for \(g=2\) this is the class of Sidon sets. The maximal cardinalities are denoted by \(R(g,n)\) and \(C(g,n)\), resp. Known bounds and constructions are reviewed and new constructions are given. These are mostly formed as unions of Sidon sets arising in the constructions of Singer, Bose and the reviewer. The asymptotic behaviour of these functions is known only for \(g=2,3\) (and in the case of \(C(g,n)\), only for special values of \(n\)). The authors are particularly interested in \[ \sigma (g) = \liminf R(g,n)/\sqrt {[g/2]n} , \] and they conjecture that \(\sigma (g)\to \sqrt 2\). The known lower and upper bounds are \(11/\sqrt {96}=1.225\dots \) and 1.8391. The paper also contains figures, graphs and open problems to meditate on.

Recommendations

Cites work

Cited in

(23)

This page was built for publication: Constructions of generalized Sidon sets.

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