Constructions of Generalized Sidon Sets
| dc.creator | Martin, Greg | |
| dc.creator | O'Bryant, Kevin | |
| dc.date | 2004-08-05 | |
| dc.date | 2005-02-21 | |
| dc.date.accessioned | 2026-07-07T06:34:15Z | |
| dc.date.available | 2026-07-07T06:34:15Z | |
| dc.description | 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. | |
| dc.description | 15 pages, 1 figure (revision fixes typos, adds a few details, and adjusts notation) | |
| dc.identifier | https://arxiv.org/abs/math/0408081 | |
| dc.identifier | http://arxiv.org/abs/math/0408081 | |
| dc.identifier | J. Combin. Theory Ser. A 113 (2006), no. 4, 591--607. | |
| dc.identifier | doi:10.1016/j.jcta.2005.04.011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/99470 | |
| dc.subject | Number Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 11B34; 05B10 | |
| dc.title | Constructions of Generalized Sidon Sets | |
| dc.type | text |