Sunflowers and friends

Computer Science/Discrete Mathematics Seminar I
Topic:Sunflowers and friends
Speaker:Shachar Lovett
Affiliation:University of California San Diego
Date:Monday, November 5
Time/Room:11:15am - 12:15pm/West Building Lecture Hall
Video Link:

The Erdos-Rado sunflower conjecture is one of the tantalizing open problems in combinatorics. In my talk, I will describe several attempts on how to get improved bounds for it. These will lead to surprising connections with several other combinatorial structures, such as randomness extractors, intersecting families and DNFs. 

Based on joint works with Xin Li, Noam Solomon and Jiapeng Zhang.