Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-08T09:50:49.064Z Has data issue: false hasContentIssue false

Sidon Sets

Published online by Cambridge University Press:  20 November 2018

H. L. Abbott*
Affiliation:
Department of Mathematics University of Alberta Edmonton, Alberta, Canada T6G 2G1
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1990