Constructions of Generalized Sidon Sets

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_i\in S; such sets are called Sidon sets if g=2 and generalized Sidon sets if g\ge 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.

15 pages, 1 figure (revision fixes typos, adds a few details, and adjusts notation)

References in corpus (1)

• Continuous Ramsey Theory and Sidon Sets

Cited by in corpus (7)

• Energy Conservation in Optical Fibers with Distributed Brick-Walls Filters
• Generalized Sidon sets
• A numerical note on upper bounds for b 2 [g] sets
• $\mathbf{Q}$-independence and the construction of $B_h$-sets of integers and lattice points
• The Symmetric Subset Problem in Continuous Ramsey Theory
• Upper and lower bounds on the size of $B_k[g]$ sets
• $B_h[g]$ modular sets from $B_h$ modular sets