Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

Improved bounds for sunflowers

Ryan Alweiss (Princeton)

Location:  Hill 705
Date & time: Monday, 21 October 2019 at 2:00PM - 3:00PM

Abstract: An r-sunflower is a collection of r sets so that the intersection of any two are the same. Given a fixed constant r, how many sets of size w can we have so that no r of them form an r-sunflower? Erdos and Rado introduced this problem in 1960 and proved a bound of w^(w(1+o(1)), and until recently the best known bound was still of this form. Furthermore, Erdos offered $1000 for a proof of a bound of c^w, where c depends on r. We prove a bound of (log w)^(w(1+o(1)).

Joint work with Shachar Lovett, Kewen Wu, and Jiapeng Zhang.

Special Note to All Travelers

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.