BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Counting Sidon Sets - Wojciech Samotij\, Cambridge
DTSTART:20111014T150000Z
DTEND:20111014T160000Z
UID:TALK33806@talks.cam.ac.uk
CONTACT:Ben Green
DESCRIPTION:A set A of integers is called a Sidon set if all the\npairwise
  sums x+y\, with x and y elements of A\, are distinct. Let S(n)\ndenote th
 e family of Sidon subsets of {1\, ...\, n}. A central problem in the\nstud
 y of Sidon sets is that of determining the maximum possible size s(n)\nof 
 a set A in S(n). In this talk\, we address the (closely related) problem\n
 of estimating |S(n)| and show that |S(n)| \\leq 2^{C\\sqrt{n}} for some\nc
 onstant C\, which is asymptotically sharp for the logarithm. This is joint
 \nwork with Yoshiharu Kohayakawa\, Sangjune Lee\, and Vojtech Rodl.
LOCATION:MR15\, CMS
END:VEVENT
END:VCALENDAR