A Complete Annotated Bibliography of Work Related to Sidon Sequences

By Kevin O'Bryant. 2004

237 citations recorded by the source corpus.

A Sidon sequence is a sequence of integers $a_1 < a_2 < \cdots$ with the property that the sums $a_i + a_j$ $(i\le j)$ are distinct. This work contains a survey of Sidon sequences and their generalizations, and an extensive annotated and hyperlinked bibliography of related work.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/8cc7f11af475ae85659ebe4edb05c7eec158ace6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Jacques Verstraëte
2. Greg Martin

In Computational Theory and Mathematics

1. Jacques Verstraëte
2. Greg Martin
3. Kevin O'Bryant
4. Richard Montgomery
5. Hong Liu

In Electrical and Electronic Engineering

1. Jacques Verstraëte
2. Greg Martin
3. Kevin O'Bryant

Citations in the corpus

• Many sets have more sums than differences (2006, background): “Such sets are called Sidon sets [3], but as a+b = c+d if and only if a−d = c−b, such sets also have the maximal number of differences and thereby are not MSTD sets.”
• Extremal problems for cycles in graphs (2016, background): “In the case k = 2, A is called a Sidon set (see O’Bryant [104] for a survey of Sidon sets).”