Workshop Program

Sunday, January 5

9:00 - 9:30 Morning coffee
9:30 - 10:30 Gil Cohen Analytic approaches to spectral graph theory: insights from free probability
10:30 - 11:30 Nir Lazarovich Groups acting on cubical complexes
11:30 - 11:40 Break
11:40 - 12:40 Amir Yehudayoff Finite Coxeter groups
12:40 - 14:00 Lunch
14:00 - 15:00 Esty Kelman Sparse Graph Counting and Applications to Systems of Linear Forms
15:00 - 15:30 Coffee
15:30 - 16:30 Pavel Panteleev Quantum LDPC Codes from HDXs

Monday, January 6

9:00 - 9:30 Morning coffee
9:30 - 10:30 Amir Yehudayoff Finite Coxeter groups
10:30 - 11:30 Michael Chapman Inapproximability of graphs and algebraic structures using interactive proofs
11:30 - 11:40 Break
11:40 - 12:40 Nir Lazarovich Groups acting on cubical complexes
12:40 - 14:00 Lunch
14:00 - 15:00 Dor Minzer Alphabet-Soundness Tradeoff in PCPs and Global Hypercontractivity
15:00 - 15:30 Coffee
15:30 - 16:30 Dani Special Cubical Complexes
16:30 - 17:30 Avi Wigderson Expansion in groups - a survey

Tuesday, January 7

9:00 - 9:30 Morning coffee
9:30 - 10:30 Noga Ron-Zewi Highly-efficient local proofs and codes
10:30 - 11:30 Noga Ron-Zewi cont
11:30 - 11:40 Break
11:40 - 12:40 Michael Chapman Inapproximability of graphs and algebraic structures using interactive proofs
12:40 - 14:00 Lunch
14:00 - 15:00 Dor Minzer Size Efficient PCPs and Fault-tolerant Routing on HDX
15:00 - 15:30 Coffee
15:30 - 16:30 Gil Cohen Analytic approaches to spectral graph theory: insights from free probability
16:30 - 17:30 Izhar Oppenheim Coboundary expansion in coset complexes

Wednesday, January 8

9:00 - 9:30 Morning coffee
9:30 - 10:30 Gil Cohen Analytic approaches to spectral graph theory: insights from free probability
10:30 - 11:30 Michael Chapman Inapproximability of graphs and algebraic structures using interactive proofs
11:30 - 11:40 Break
11:40 - 12:40 Guy Kindler Hypercontractivity
12:40 - 14:00 Lunch
14:00 - 15:00 Nir Lazarovich Groups acting on cubical complexes
15:00 - 15:30 Coffee
15:30 - 16:30 Noam Lifshitz Product mixing in groups
16:30 - 17:30 Dor Minzer On Approximability of Satisfiable CSPs and Friends