All talks are listed in Pacific Time. **Schedule subject to change.**

–
Coffee and Check-in
–
Opening Remarks
–
Nearly all k-SAT Functions are Unate
Yufei Zhao (Massachusetts Institute of Technology)
–
Break
–
P-smallness of Increasing Families
Jinyoung Park (Courant Institute, NYU)
–
Lunch
–
Top-Down Lower Bounds for Depth-Four Circuits
Mika Göös (EPFL)
–
Break
–
Larger Corner-free Sets in High Dimensions
Lianna Hambardzumyan (Hebrew University)
–
Reception
–
Coffee and Check-in
–
An Improved Bound for Regular Partitions of Hypergraph of Bounded VC_2 Dimension
Caroline Terry (University of Maryland)
–
Break
–
Testing Thresholds for High-dimensional Sparse Random Geometric Graphs
Siqi Liu (UC Berkeley)
–
Lunch
–
Higher-dimensional Expansion of Random Geometric Complexes
Tselil Schramm (Stanford University)
–
Break
–
Open Problem Session
–
Coffee and Check-in
–
A Polynomial Bogolyubov type Result for the Special Linear Group
Guy Kindler (Hebrew University of Jerusalem)
–
Break
–
Higher-order Generalisations of Stability and Arithmetic Regularity
Julia Wolf (University of Cambridge)
–
Lunch
–
A New Upper Bound for the Heilbronn Triangle Problem
Cosmin Pohoata (IAS)
–
Break
–
Tight Space Complexity of the Coin Problem
Sumegha Garg (Stanford University)
–
Coffee and Check-in
–
Sign-rank vs Margin
Kaave Hosseini (University of Rochester)
–
Break
–
Fourier Growth of XOR-Fibers of Communication Protocols
Uma Girish (Princeton University)
–
Lunch
–
Randomized versus Deterministic Decision Tree Size
Nikhil Mande (University of Liverpool)
–
Break
–
Richard M. Karp Distinguished Lecture by Shachar Lovett
–
Coffee and Check-in
–
Structures in Random Graphs: New Connections
Huy Tuan Pham (Stanford University)
–
Break
–
Correspondence Colouring of Random Graphs
Liana Yepremyan (Emory University)
–
Lunch
–
Structure Of Boolean Almost Low Degree Functions On The Biased Cube
Yuval Filmus (Technion - Israel Institute of Technology)
–
Break