Computer Science/Discrete Mathematics Seminar II
Problems in Extremal Combinatorics and Connections with Multiparty Communication Complexity
In this talk we will discuss some recent progress on some questions in extremal combinatorics and in multiparty communication complexity.
We will also discuss some general connections between the two fields, emphasizing how certain problems (e.g., the famous "Corners Problem" in extremal combinatorics) can be equivalently expressed as a natural problem in the language of either field.
A common theme to the new results discussed is that they rely on (and refine) the new ideas that contributed to the recent progress on the 3AP problem due to Raghu Meka and myself.
Based on joint works with Amir Abboud, Nick Fischer, Shachar Lovett, Raghu Meka and Xin Lyu.
Date & Time
December 17, 2024 | 10:30am – 12:30pm