Sidon Sets
Canadian mathematical bulletin, Tome 33 (1990) no. 3, pp. 335-341
Voir la notice de l'article provenant de la source Cambridge
Denote by g(n) the largest integer m such that every set of integers of size n contains a subset of size m whose pairwise sums are distinct. It is shown that g(n) > cn1/2 for any constant c < 2/25 and all sufficiently large n.
Abbott, H. L. Sidon Sets. Canadian mathematical bulletin, Tome 33 (1990) no. 3, pp. 335-341. doi: 10.4153/CMB-1990-056-6
@article{10_4153_CMB_1990_056_6,
author = {Abbott, H. L.},
title = {Sidon {Sets}},
journal = {Canadian mathematical bulletin},
pages = {335--341},
year = {1990},
volume = {33},
number = {3},
doi = {10.4153/CMB-1990-056-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1990-056-6/}
}
Cité par Sources :