Bernoulli Center summer school "Synergies of Combinatorics and Theoretical Computer Science"
Event details
| Date | 09.09.2024 › 13.09.2024 |
| Hour | 09:00 › 12:30 |
| Speaker | Shachar Lovett (UCSD), topic: Sunflowers, spreadness and the Kahn-Kalai conjecture. Bhavik Mehta (Cambridge), topic: Automated theorem proving. Raghu Meka (UCLA), topic: 3-term arithmetic progressions, spreadness, and the polynomial method. |
| Location |
Bernoulli Center
Online
|
| Category | Conferences - Seminars |
| Event Language | English |
Recently, several breakthroughs on long-standing open problems in combinatorics and theoretical computer science have resulted from synergistic connections between these two areas. This summer school will cover some of these connections and results, as well as some recent exciting developments in automatic theorem proving in these areas.
This Bernoulli Center summer school is intended for motivated graduate and postdoctoral students of mathematics or computer science.
Practical information
- Informed public
- Invitation required
Organizer
- Professor Ola Svensson
Contact
- Professor Ola Svensson, [email protected]