# Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

### Joint IAS/Princeton/Montreal/Paris/Tel-Aviv Symplectic Geometry Zoominar

The group of Hamiltonian diffeomorphisms of a symplectic manifold admits a remarkable bi-invariant metric, called Hofer’s metric. My talk will be about a recent joint work with Dan Cristofaro-Gardiner and Vincent Humilière resolving the following...

### Ruth and Irving Adler Expository Lecture in Mathematics

The physicist Abrikosov predicted that in certain superconductors, one should observe triangular lattices of vortices, now called Abrikosov lattices. When studying ground states of Coulomb gases, which is motivated by questions in approximation...

### Workshop on Topology: Identifying Order in Complex Systems

In this talk, I will give an overview of some recent results motivated by the computation and applications of persistent homology, a theory that creates a bridge between the continuous world of topology and the discrete world of data, and assigns...

### Computer Science/Discrete Mathematics Seminar I

For a fixed integer k > 1, the Boolean k-XOR problem consists of a system of linear equations mod 2 with each equation involving exactly k variables. We give an algorithm to strongly refute *semi-random* instances of the Boolean k-XOR problem on n...

### Computer Science/Discrete Mathematics Seminar I

For a fixed integer k > 1, the Boolean k-XOR problem consists of a system of linear equations mod 2 with each equation involving exactly k variables. We give an algorithm to strongly refute *semi-random* instances of the Boolean k-XOR problem on n...

### Members’ Seminar

New types of symmetries have been considered in algebra and algebraic geometry and a higher analog of representation theory has been developed to answer questions of classical representation theory. Geometric representation theory can be viewed as...

### Computer Science/Discrete Mathematics Seminar II

Each vertex of an arbitrary simple graph on n vertices chooses k random incident edges. What is the expected number of edges in the original graph that connect different connected components of the sampled subgraph? We prove that the answer is O(n/k...

### Computer Science/Discrete Mathematics Seminar II

Each vertex of an arbitrary simple graph on n vertices chooses k random incident edges. What is the expected number of edges in the original graph that connect different connected components of the sampled subgraph? We prove that the answer is O(n/k...