Recently, there have been several breakthroughs on long-standing open problems in combinatorics and theoretical computer science, resulting from such synergistic connections between these two areas. This month-long program is focusing on the connections and unifying themes between combinatorics and theoretical computer science. It includes a one-week workshop with leading experts from both areas, a one-week summer school for graduate students and post-docs as well as the possibility of long-term research stays for the entire one-month program.
Program dates: August 19 to September 13, 2024.
Venue: Bernoulli Center at EPFL
Organizers: Shachar Lovett (UCSD), Raghu Meka (UCLA), Lisa Sauermann (U. Bonn), Ola Svensson (EPFL)
Workshop
There will be a one-week workshop from August 19 to August 23, 2023. Due to space constraints, participation in the workshop is by invitation only.
Schedule and abstracts
Videos and slides
Summer School
There will be a one-week summer school for students and post-docs from September 9 to September 13, 2024. The summer school will contain three tracks of talks that cover emerging themes in combinatorics and theoretical computer science. The speakers are:
- Shachar Lovett, topic: Sunflowers, spreadness and the Kahn-Kalai conjecture
- Bhavik Mehta, topic: Automated theorem proving
- Raghu Meka, topic: 3-term arithmetic progressions, spreadness, and the polynomial method
The application for the summer school is closed.
Month-long research stays
There is a limited number of spots for long-term guests (staying for all or most of the duration of the program). The Bernoulli Center will provide accommodation and offers financial support for travel expenses.
All accepted long-term guests will automatically be invited for the workshop and the summer school as well.
The application for long-term research stays is closed.