August 19 – September 13
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.
Website : https://bernoulli.epfl.ch/comb2024/
All slides : https://drive.switch.ch/index.php/s/BdzebqB1aAZtkcP
Recordings :
Monday 19 August
Rico Zenklusen: Random-Assignment Matroid Secretary Without Knowing the Matroid
Matthew Kwan: Resolution of the Quadratic Littlewood-Offord problem
Vera Traub: The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
Sorrachai Yingchareonthawornchai: How to Search and Sort using Forbidden 0-1 Matrix Theory – Slides
Alexey Gordeev: Combinatorial Nullstellensatz and the Erdős box problem – Slides
Sophie Huiberts: Short Stories about Linear Programming – Slides
Tuesday 20 August
Nati Linial: The Rank-Ramsey Problem and the Log-Rank Conjecture – Slides
Rob Morris: Geometric conjectures and Ramsey numbers
Pravesh Kothari: Spectral Refutation via Kikuchi Matrices and Applications
Mehtaab Sawhney: Improved Bounds for Szemerédi’s Theorem
Venkatesan Guruswami: Combinatorial challenges in coding theory: A sampler
Wednesday 21 August
Benny Sudakov: SDP, MaxCut, discrepancy and log-rank-conjecture
Hannaneh Akrami: Epistemic EFX Allocations Exist for Monotone Valuations
Zixuan Xu: Essential covers of the hypercube requires many hyperplanes
Sammy Luo: A New Polynomial Method in Additive Combinatorics – Slides
Maya Sankar: On the Generalized Ramsey–Turan Density of Cliques
Thursday 22 August
Daniel Král’: Matroid depth and width parameters
Nathan Klein: Ghost Value Augmentation for k-Edge-Connectivity
Matija Bucic: Robust sublinear expanders
Omar Alrabiah: Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Oliver Janzer: Edge-disjoint cycles with the same vertex set
Friday 23 August
Parinya Chalermsook: Approximation Schemes for Clustering through Scatter Dimension
Peter Manohar: New Spectral Techniques in Algorithms, Combinatorics, and Coding
Daniel Dadush: Column Bounds for the Circuit Imbalance Measure
Monday 09 September
9-10:30: Shachar Lovett, lecture 1 (A1)
11 – 12:30: Raghu Meka, lecture 1 (B1)
3:30 – 5: Bhavik Mehta, lecture 1 (C1)
Tuesday 10 September
9-10:30: Shachar Lovett, lecture 2 (A2)
11 – 12:30: Raghu Meka, lecture 2 (B2)
Wednesday 11 September
9-10:30: Shachar Lovett, lecture 3 (A3)
11 – 12:30: Raghu Meka, lecture 3 (B3)
3:30 – 5: Lean Bhavik Mehta, lecture 2 (C2)
Thursday 12 September:
9-10:30: Bhavik Mehta, lecture 3 (C3)
11 – 12:30: Shachar Lovett, lecture 4 (A4)
Friday 13 September:
9-10:30: Raghu Meka, lecture 4 (B4)
11 – 12:30: Bhavik Mehta, lecture 4 (C4)
