On the ubiquity of Sidon sets

Abstract

A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B2[g]-set is a set A of integers such that no integer has more than g essentially distinct representations as the sum of two elements of A. It is proved that almost all small sumsets of 1,2,...,n are B2[g]-sets, in the sense that if B2[g](k,n) denotes the number of B2[g]-sets of cardinality k contained in the interval 1,2,...,n, then limn∞ B2[g](k,n)/nk = 1 if k = o(ng/(2g+2)).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…