Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:B2_set
|
| gptkbp:application |
Fourier analysis
coding theory number theory |
| gptkbp:citation |
Paul Erdős, Pál Turán, 'On a problem of Sidon in additive number theory, and on some related problems', J. London Math. Soc. 16 (1941), 212–215.
|
| gptkbp:defines |
A set of integers such that all pairwise sums are distinct
|
| gptkbp:example |
{1,2,4,7} is a Sidon set
|
| gptkbp:field |
gptkb:mathematics
harmonic analysis additive combinatorics |
| gptkbp:generalizes |
B_h set
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sidon set
|
| gptkbp:maximalSize |
The maximal size of a Sidon set in {1,...,N} is about sqrt(N)
|
| gptkbp:namedAfter |
gptkb:Simon_Sidon
|
| gptkbp:property |
If A is a Sidon set, then for any a,b,c,d in A, a+b = c+d implies {a,b} = {c,d}
|
| gptkbp:relatedConcept |
difference set
sumset additive basis |
| gptkbp:studiedBy |
gptkb:Simon_Sidon
|
| gptkbp:bfsParent |
gptkb:Golomb_ruler
|
| gptkbp:bfsLayer |
7
|