Events and Activities

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

Mar
05
2021

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

Periodic Floer homology and the large-scale geometry of Hofer's metric on the sphere
9:15am|Remote Access

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...

Mar
05
2021

Ruth and Irving Adler Expository Lecture in Mathematics

From superconductors to Coulomb gases: crystallization questions
Sylvia Serfaty
2:00pm|Remote Access - see Zoom link below

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...

Mar
05
2021

Workshop on Topology: Identifying Order in Complex Systems

Persistent matchmaking
Uli Bauer
2:00pm|Remote Access

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...

Mar
08
2021

Computer Science/Discrete Mathematics Seminar I

Strong refutation of semi-random Boolean CSPs
11:15am|Remote Access - see Zoom link below

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...

Mar
08
2021

Computer Science/Discrete Mathematics Seminar I

Strong refutation of semi-random Boolean CSPs
11:15am|Remote Access - see Zoom link below

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...

Mar
08
2021

Members’ Seminar

Higher Representation Theory
2:00pm|Simonyi Hall 101 and Remote Access

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...

Mar
09
2021

Computer Science/Discrete Mathematics Seminar II

Random k-out subgraphs
10:30am|Simonyi Hall 101 and Remote Access - see Zoom link below

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...

Mar
09
2021

Computer Science/Discrete Mathematics Seminar II

Random k-out subgraphs
10:30am|Simonyi Hall 101 and Remote Access - see Zoom link below

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...