Over the last few decades, analysis of Boolean functions has been extended beyond the Boolean hypercube to continuous domains such as the solid cube, Gaussian space, as well as to other discrete settings such as the Grassmann graph and the symmetric group. These domains play a significant role in numerous areas in TCS, such as hardness of approximation, pseudorandomness, MCMC algorithms, and high-dimensional expansion. The goal of this workshop is to introduce the state of the art techniques and developments in this context and explore new connections between them and other notable challenges in TCS and discrete mathematics.

Dor Minzer (Massachusetts Institute of Technology; chair)
Invited Participants

Nima Anari (Stanford University), Mitali Bafna (Carnegie Mellon University), Amey Bhangale (UC Riverside), Yuansi Chen (Duke University), Anindya De (University of Pennsylvania), Yotam Dikstein (Weizmann Institute of Science), Renan Gross (Tel Aviv University), Prahladh Harsha (Tata Institute of Fundamental Research), Pooya Hatami (Ohio State University), Nathaniel Hopkins (UC San Diego), Paata Ivanisvili (UC Irvine), Zander Kelley (University of Illinois Urbana-Champaign), Subhash Khot (Courant Institute, NYU), Guy Kindler (Hebrew University of Jerusalem), Ohad Klein (Bar-Ilan Univesity), Anqi Li (MIT), Noam Lifshitz (Hebrew University), Nathan Lindzey (Technion - Israel Institute of Technology), Siqi Liu (UC Berkeley), Yang Liu (Stanford University), Kuikui Liu (University of Washington), Dan Mikulincer (MIT), Sidhanth Mohanty (UC Berkeley), Elchanan Mossel (Massachusetts Institute of Technology), Ryan O'Donnell (Carnegie Mellon University), Shayan Oveis Gharan (University of Washington), Mehtaab Sawhney (MIT), Tselil Schramm (Stanford University), Makrand Sinha (Simons Institute), Li-Yang Tan (Stanford University), Luca Trevisan (Bocconi University, Milan, Italy), Pei Wu (Institute for Advanced Study), Kai Zhe Zheng (Massachusetts Institute of Technology)