Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a theory seminar on "Coding for Sunflowers" presented by Anup Rao from the University of Washington. Delve into recent progress on the Erdos and Rado sunflower conjecture, focusing on the work of Alweiss, Lovett, Wu, and Zhang. Discover a simplified proof demonstrating that any family of k-sized sets containing O(p log(pk) log(p log(pk)))^k sets must contain a sunflower with p petals. Learn about the implications of this research for set theory and combinatorics. Originally recorded on October 8, 2019, this 58-minute lecture includes closed captions and is part of the Paul G. Allen School's theory seminar series.
