University of Cambridge > Talks.cam > Discrete Analysis Seminar > Counting Sidon Sets

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Counting Sidon Sets

Download to your calendar using vCal

  • UserWojciech Samotij, Cambridge
  • ClockFriday 14 October 2011, 16:00-17:00
  • HouseMR15, 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 ex-directory lists are not shown.

Other lists

Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Cambridge DOCking Station Room CGO 18 @ Student Services Centre - Old Cavendish East Wing

Other talks

Wolfson Tool Factory Geometry and Generalization: The case of Grokking Spectral theory for Dirac operators with singular potentials Title to be confirmed Secrets of the Surface: The Mathematical Vision of Maryam Mirzakhani ( EDI Film Screening) Afternoon Break
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity