The Sidon Set Problem is a central problem in additive number theory that seeks to determine the maximum size of a set of natural numbers in which all pairwise sums of distinct elements are unique, thereby characterizing the extremal properties of such sets under additive constraints.
60
Publications
2.2K
Citations
85
Authors
67
Institutions
Publications per year
2017–2026
11
Parents
Publications
60
A Dense Infinite Sidon Sequence
Miklós Ajtai, János Komlós, Endre Szemerédi · European Journal of Combinatorics · 1981 · 137 citations
Felix Lazebnik, Jacques Verstraëte · The Electronic Journal of Combinatorics · 2003 · 76 citations · Full text
1–5 of 60
Authors
85
- KE
4
h-index
- CC
4
h-index
- NJ
4
h-index
- JC
3
h-index
- KO
3
h-index
1–5 of 85
Institutions
67
University of British Columbia
Vancouver, Canada
6 h-index
6 publications
105 citations
University of Waterloo
Waterloo, Canada
5 h-index
8 publications
117 citations
Guangzhou University
Guangzhou, China
5 h-index
8 publications
144 citations
Universidad Autónoma de Madrid
Madrid, Spain
3 h-index
3 publications
73 citations
University of Missouri
Columbia, United States
3 h-index
3 publications
95 citations
Eötvös Loránd University
Budapest, Hungary
3 h-index
5 publications
298 citations
University of Oregon
Eugene, United States
2 h-index
4 publications
70 citations
Institute of Mathematical Sciences
Madrid, Spain
2 h-index
2 publications
58 citations
1–8 of 67
Venues
- Journal of Number Theory
4 publications · 83 citations
4
h-index
- Colloquium Mathematicum
4 publications · 67 citations
4
h-index
- COMBINATORICA
3 publications · 73 citations
3
h-index
- The Electronic Journal of Combinatorics
3 publications · 266 citations
3
h-index
- Acta Mathematica Academiae Scientiarum Hungaricae
2 publications · 23 citations
2
h-index
1–5