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)

Registration is required to attend this workshop. Space may be limited, and you are advised to register early. The link to the registration form will appear on this page approximately 10 weeks before the workshop. To submit your name for consideration, please register and await confirmation of your acceptance before booking your travel.

Further details about this workshop will be posted in due course. To contact the organizers about this workshop, please complete this form.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials.