Past Events

The game of Cops and Robbers is a two-player pursuit–evasion game played on a graph, in which a set of cops attempt to capture a single robber. The players occupy vertices and take turns moving along edges; capture occurs when a cop and the robber...

We discuss a differential geometric construction of distinguished holomorphic 2-spheres inside a K3 surface. These 2-spheres degenerate to a line on an affine 3-manifold. The example illustrates a general principle in the SYZ program, where graphs on...

We study semi-discrete variational optimal-transport problems between a continuous source measure and a discrete target measure supported on a 1-d space. We identify discrete nestedness conditions that simplify the matching structure, and propose...

Recent applications in machine learning have renewed the community’s interest in min-max optimization problems. While gradient-based optimization methods are widely used to solve these problems, there exist many scenarios where such techniques are...

This talk provides a gentle introduction to Arthur packets, a less gentle introduction to generalized local Arthur packets, and concludes with an application to a problem in quantum circuit design.

This talk focuses on the inverse eigenvalue problem for graphs (IEPG), which seeks to determine the possible spectra of symmetric matrices associated with a given graph G. These matrices have off-diagonal non-zero entries corresponding to the edges...

The question of how species coexist is one of the most fundamental questions in ecology. The standard approach for using models to understand what leads to ecological coexistence can be caricatured as start with a model, specify parameters, and look...

Real-world systems—from academic collaborations and computer networks to biological systems and power grids—are often large, heterogeneous, and highly interconnected. A first step towards understanding these systems is choosing an appropriate...

Given a symmetric matrix with a given sign pattern, what can the sign patterns of its eigenvectors look like? This simple question is closely related to the study of discrete nodal statistics, and draws strong parallels with classical results in...

We will review different notions of anti-concentration, arising from geometry, analysis, and probability. One focus of the talk will be on understanding how these definitions relate to each other, sometimes leading to surprising and nontrivial...