Counting Sidon Sets
Add to your list(s)
Download to your calendar using vCal
 Wojciech Samotij, Cambridge
 Friday 14 October 2011, 16:0017:00
 MR15, CMS.
If you have a question about this talk, please contact Ben Green.
Tea in Pavilion E from 3.30pm
A set A of integers is called a Sidon set if all the
pairwise sums x+y, with x and y elements of A, are distinct. Let S(n)
denote the family of Sidon subsets of {1, ..., n}. A central problem in the
study of Sidon sets is that of determining the maximum possible size s(n)
of a set A in S(n). In this talk, we address the (closely related) problem
of estimating S(n) and show that S(n) \leq 2^{C\sqrt{n}} for some
constant C, which is asymptotically sharp for the logarithm. This is joint
work with Yoshiharu Kohayakawa, Sangjune Lee, and Vojtech Rodl.
This talk is part of the Discrete Analysis Seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
