Seminars and Colloquia by Series

Bordered Floer homology

Series
School of Mathematics Colloquium
Time
Friday, December 5, 2025 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Peter OzsváthPrinceton

Heegaard Floer homology is a tool for studying three- and four-dimensional manifolds, using methods that are inspired by symplectic geometry. Bordered Floer homology is tool, currently under construction, for understanding how to reconstruct the Heegaard Floer homology in terms of invariants associated to its pieces. This approach has both conceptual and computational ramifications. In this talk, I will sketch the outlines of Heegaard Floer homology, with an emphasis on recent progress in bordered Floer homology. Heegaard Floer homology was developed in collaboration with Zoltan Szabo; bordered Floer homology is joint work with Robert Lipshitz and Dylan Thurston.

100 years of Sperner's Lemma: proofs, generalizations, and applications

Series
School of Mathematics Colloquium
Time
Thursday, November 13, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Francis SuHarvey Mudd College

Sperner's lemma is a simple combinatorial result that is surprisingly powerful and useful---bringing together ideas in combinatorics, geometry, and topology while attracting interest from economists and game theorists. I'll explain why, show some old and new proofs, and present some recent generalizations with diverse applications.

On two problems in scientific machine learning: learning interaction laws in particle systems, and digital twins in cardiac electrophysiology

Series
School of Mathematics Colloquium
Time
Thursday, November 6, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Mauro MaggioniJohns Hopkins University

I will discuss recent results in two research directions at the intersection of scientific machine learning and modeling of dynamical systems.

First, we consider systems of interacting agents or particles, which are commonly used in models throughout the sciences, and can exhibit complex, emergent large-scale dynamics, even when driven by simple interaction laws.  We consider the following inference problem: given only observations of trajectories of the agents in the system, can we learn the unknown laws of interactions? We cast this as an inverse problem, discuss when this problem is well-posed, construct estimators for the interaction kernels with provably good statistical and computational properties, even in the nonparametric estimation regime when only minimal information is provided about the form of such interaction laws. We also demonstrate numerically that the estimated systems can accurately reproduce the emergent behaviors of the original systems, even when the observations are so short that no emergent behavior was witnessed in the training data. We also discuss the case where the agents are on an unknown network, and we need to estimate both the interaction kernel and the network.

In the second part of the talk, I will discuss recent applications of deep learning in the context of digital twins in cardiology, and in particular the use of operator learning architectures for predicting solutions of parametric PDEs, or functionals thereof, on a family of diffeomorphic domains — the patient-specific hearts -- which we apply to the prediction of medically relevant electrophysiological features of heart digital twins.

Heights and diameters of random trees and graphs

Series
School of Mathematics Colloquium
Time
Thursday, October 16, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Louigi Addario-BerryMcGill University
Fix a finite set S of graphs, and let U be a uniformly random sample from S. We ask the question: what is the statistical behaviour of diam(U), the greatest graph distance between any two vertices in U? Many variants of this question have been asked, including for branching process trees (starting with the work of Kolmogorov 1938) and regular graphs (starting with the work of Bollobás 1982). 
 
Two natural and very general settings for this question are when S has the form 
 
S_1={T is a rooted tree with vertex set V(T)={1,...,n} and vertex degrees (d_1,...,d_n)}
or
S_2={G is a simple graph with vertex set V(G)={1,...,n} and vertex degrees (d_1,...,d_n)} 
 
We explain how to answer such questions, and to prove tight diameter upper bounds, in both cases. One of the challenges in proving the results for S_2 is that in general we know neither how to approximately enumerate nor to efficiently sample from sets of the form S_2. 
 
Time permitting, I may also discuss diameter lower bounds. 
 
Based on joint works with Serte Donderwinkel, Gabriel Crudele, and Igor Kortchemski.

Why Language Models Hallucinate

Series
School of Mathematics Colloquium
Time
Thursday, October 2, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Santosh VempalaGeorgia Tech

Large language models often guess when uncertain, producing plausible yet incorrect statements instead of admitting uncertainty. Such "hallucinations" persist even in state-of-the-art systems. We analyze this phenomenon from a mathematical perspective and find that the statistical pressures of current training pipelines induce hallucinations; moreover, current evaluation procedures reward guessing over acknowledging uncertainty. The talk will be fact-based, and the speaker will readily admit ignorance. 

 
This is joint work with (and mostly by) Adam Kalai. 

Novel metrics of entanglement of open curves in 3-space and their applications to proteins

Series
School of Mathematics Colloquium
Time
Thursday, September 25, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Eleni PanagiotouArizona State University

Filamentous materials may exhibit structure-dependent material properties and function that depend on their entanglement. Even though intuitively entanglement is often understood in terms of knotting or linking, many of the filamentous systems in the natural world are not mathematical knots or links. In this talk, we will introduce a novel and general framework in knot theory that can characterize the complexity of open curves in 3-space. This leads to new metrics of entanglement of open curves in 3-space that generalize classical topological invariants, like for example, the Jones polynomial and Vassiliev invariants. For open curves, these are continuous functions of the curve coordinates and converge to topological invariants of classical knots and links when the endpoints of the curves tend to coincide. These methods provide an innovative approach to advance important questions in knot theory. As an example, we will see how the theory of linkoids enables the first, to our knowledge, parallel algorithm for computing the Jones polynomial.

Importantly, this approach opens exciting applications to systems that can be modeled as open curves in 3-space, such as polymers and proteins, for which new quantitative relationships between their structure and material properties become evident. As an example, we apply our methods to proteins to understand the interplay between their structures and functions. By analyzing almost all protein structures in the Protein Data Bank, we derive for the first time a quantitative representation of the topology/geometry of the Topological Landscape of proteins. We show that 3 topological and geometrical parameters alone can predict the biological classifications of proteins with high accuracy. Moreover, preliminary results show that our proposed topological metrics based on static protein structures alone correlate with protein dynamics and protein function. The methods and results represent a new framework for advancing knot theory, as well as its applications to filamentous materials, which can be validated by experimental data and integrated into machine-learning algorithms.

Volume Polynomials

Series
School of Mathematics Colloquium
Time
Friday, September 19, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
June HuhPrinceton University

Volume polynomials constitute a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties arising from convex bodies and projective varieties. I will introduce new entropy inequalities satisfied by volume polynomials, discuss applications to the combinatorics of algebraic matroids, introduce the new class of analytic matroids, and pose several open questions (based on joint with Lukas Grund, Mateusz Michalek, Henrik Süss, and Botong Wang).

How Mathematics Can Drive Innovation in Artificial Intelligence

Series
School of Mathematics Colloquium
Time
Thursday, August 28, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Talitha WashingtonHoward University

Mathematics is at the core of artificial intelligence, from the linear algebra that powers deep learning to the probability and optimization driving new algorithms. We will explore how mathematical ideas can open new directions for AI innovation and how recent U.S. AI policy trends are shaping research priorities. Together, these perspectives reveal opportunities for mathematicians to influence the design and future of AI technologies.

Random matrices and logarithmically correlated fields

Series
School of Mathematics Colloquium
Time
Thursday, April 17, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Paul BourgadeNYU

The Liouville quantum gravity measure is a properly normalized exponential of 2d log-correlated fields, such as the Gaussian free field. It is the volume form for the scaling limit of random planar maps and numerous statistical physics models. I will explain how this random measure naturally appears in random matrix theory either in space time from random matrix dynamics, or in space from the characteristic polynomial of random normal matrices. A 3d log-correlated field also naturally emerges in random matrix theory, from dynamics on non-Hermitian matrices.

Local-to-global in thin orbits

Series
School of Mathematics Colloquium
Time
Thursday, March 27, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Kate StangeUniversity of Colorado, Boulder

Primitive integral Apollonian circle packings are fractal arrangements of tangent circles with integer curvatures.  The curvatures form an orbit of a 'thin group,' a subgroup of an algebraic group having infinite index in its Zariski closure.  The curvatures that appear must fall into a restricted class of residues modulo 24. The twenty-year-old local-global conjecture states that every sufficiently large integer in one of these residue classes will appear as a curvature in the packing. We prove that this conjecture is false for many packings, by proving that certain quadratic and quartic families are missed. The new obstructions are a property of the thin Apollonian group (and not its Zariski closure), and are a result of quadratic and quartic reciprocity, reminiscent of a Brauer-Manin obstruction. Based on computational evidence, we formulate a new conjecture.  This is joint work with Summer Haag, Clyde Kertzer, and James Rickards.  Time permitting, I will discuss some new results, joint with Rickards, that extend these phenomena to certain settings in the study of continued fractions.

Pages