Events and Activities

Request a reservation.
Gourmet dinner is limited to Institute Members, Faculty, Staff, Friends of the Institute, and their guests.

High-dimensional expanders (HDX) are a generalization of expander graphs which have seen various applications in coding theory, PCPs, pseudorandomness, derandomization, approximate sampling, and beyond. One technique for proving a complex is an HDX...

This semester, we will be beginning a *very informal* get-together every Monday of people interested in/working on phenomenology and new theories beyond the standard model.  The idea is to discuss over lunch, perhaps meet up around 12.20, grab lunch...

Abstract: In AdS/CFT, a spacetime geometry is said to contain a python's lunch when there exist choices of boundary regions with associated entanglement wedges that contain locally but not globally minimal surfaces. Previously, such geometries have...

Since Hironaka's famous resolution of singularities in characteristics zero in 1964, it took about 40 years of intensive work of many mathematicians to simplify the method, describe it using conceptual tools and establish its functoriality. However...

We describe the obstruction to lift Frobenius on certain Shimura varieties and apply this to the theory of companion forms for classical modular forms (Gross, Coleman-Voloch, Faltings-Jordan) and also in higher dimension.

The study of Turán numbers of graphs and hypergraphs is a rich problem in extremal combinatorics. The Turán problem asks, given a fixed forbidden (hyper)graph F, what is the maximum number of edges in an F-free (hyper)graph in terms of the number of...