The sunflower conjecture and connections to TCS

Shachar Lovett
The sunflower conjecture is one of the famous open problems in combinatorics. In attempting to improve the current known bounds, we discovered connections to objects studies in TCS, such as randomness extractors and DNFs, as well as to new questions in pseudo-randomness. I will describe some of these connections and the many open problems that arise. Based on joint works with Ryan Alweiss, Xin Li, Noam Solomon and Jiapeng Zhang.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.