Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore the second part of a lecture series examining the profound connections between sunflowers in combinatorics and threshold phenomena, delivered by Shachar Lovett from the University of California, San Diego at the IAS/PCMI Park City Mathematics Institute. Delve into the sunflower conjecture of Erdős and Rado, a fundamental open problem in combinatorics that asks for the minimal size of a family of sets that must contain a sunflower of a given size, where a sunflower is defined as a family of sets whose pairwise intersections are all identical. Discover how recent major breakthroughs on this conjecture emerged through surprising connections to computational complexity theory, and learn about subsequent developments that revealed even more unexpected links to threshold phenomena, ultimately leading to the resolution of the Kahn-Kalai conjecture, another major open problem in the field. Gain insight into how interdisciplinary connections between different areas of mathematics and theoretical computer science played a pivotal role in these groundbreaking results, with the presentation designed to be accessible to those with mathematical maturity but no specific prerequisites in the field.
