Seminars and Colloquia Schedule

The motivic Lie algebra in the cohomology of moduli spaces

Series
Algebra Seminar
Time
Monday, October 26, 2026 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sam Payne – University of Michigan

Recent work studying relations between moduli spaces in algebraic and tropical geometry reveals new and previously unexpected structures in the weight zero cohomology of moduli of curves and abelian varieties. Surprisingly, the motivic Lie algebra, a free Lie algebra with one generator in each odd degree greater than or equal to 3, whose representations control the category of mixed Tate motives over Z, appears in the weight zero cohomology of both of these spaces, with no natural map between the two. I will discuss these structures and highlight recent work of Amy Bradford that connects these two copies of the motivic Lie algebra, through the weight zero cohomology of the moduli of curves of compact type.

Kirby moves for contact 3–manifolds

Series
Geometry Topology Seminar
Time
Monday, October 26, 2026 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Vera Vértesi – University of Vienna

In this talk I will present a complete set of Legendrian Kirby moves relating diagrams of the same contact 3–manifold, yielding a contact analogue of Kirby's theorem. Our approach refines Avdek's ribbon moves by using Gervais' presentation of mapping class groups using only nonseparating curves, together with explicit constructions of Legendrian representatives. This is a joint work with with Marc Kegel and Eric Stenhede.

Learning Theory of Transformers: Sample-Efficient In-Context Learning and Softmax Partitions of Unity

Series
Applied and Computational Mathematics Seminar
Time
Monday, October 26, 2026 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/94954654170
Speaker
Zhongjie Shi – Georgia Tech –

 

Pretrained Transformers adapt to an unseen task from a short prompt, with no parameter update. This ability, known as in-context learning (ICL), raises a basic question: how does the structure shared across tasks reduce the number of examples a new task requires? We quantify low-dimensional cross-task structure through the covering numbers of the task space, without assuming an explicit parametric representation. The cover supplies anchor functions, and ICL reduces to a task-identification-and-evaluation procedure: the context localizes the unseen task among the anchors, and the prediction at a query aggregates the anchors’ values there. We construct a three-block Transformer that implements this procedure and derive a generalization bound that separates the number of pretraining tasks from the prompt length: the pretraining cost is governed by the intrinsic dimensions of the task space and input domain, while, with sufficiently many pretraining tasks, the dependence on the prompt length becomes dimension-free. The key technical tool is a local-to-global approximation principle realized by a softmax partition of unity: with suitably chosen affine scores, softmax attention produces localized weights that sum to one, so that dense, shallow Transformers with standard softmax attention and sinusoidal positional encodings can glue local approximations into a global one. We further extend this idea to operator learning: a two-level softmax partition of unity, over the input function class and the output domain, yields power-law model- and data-scaling laws for Transformer operator networks on input function classes of low intrinsic dimension. Experiments on the Burgers’ and KdV equations confirm the predicted scaling.

Critical percolation in high dimensions (Unusual Room!)

Series
Probability Working Seminar
Time
Tuesday, October 27, 2026 - 15:30 for 1.5 hours (actually 80 minutes)
Location
Skiles 368
Speaker
Pranav Chinmay – Georgia Institute of Technology –

Second of two talks.

In Bernoulli percolation, we place edges independently with probability p between vertices of a lattice, and study the resulting random geometry. In the first talk, I will give a friendly introduction to the model and discuss some of the motivating questions and the history of methods in the high dimensional setting. In the second talk, I will discuss our recently developed tool, the incipient infinite cluster, and describe how we use it to derive the exact limiting distribution of distances within clusters, as well as prove sharp asymptotics for k-point connectivity functions. These results together establish several aspects of the conjecture that the scaling limit of high dimensional critical clusters is the Integrated Super-Brownian Excursion. Based on joint work with Shirshendu Chatterjee, Jack Hanson, and Philippe Sosoe.

Toward a twistless converse theorem

Series
Athens-Atlanta Number Theory Seminar
Time
Tuesday, October 27, 2026 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Nina Zubrilina – Harvard University –

Weil's converse theorem characterizes modular forms by the functional equations of their L-functions and all of their twists by Dirichlet characters. Farmer, Koutsoliotas and Lemurell conjectured that the twist assumption is redundant, that is, a degree 2 Euler product whose L-function has a suitable functional equation should come from a Hecke eigenform. We report on some progress towards this conjecture based on work with Andrew Booker and Min Lee, as well as some recent LLM assistance.

Malle's conjecture over function fields

Series
Athens-Atlanta Number Theory Seminar
Time
Tuesday, October 27, 2026 - 17:15 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Aaron Landesman – Harvard University –

The inverse Galois problem, a foundational question in number theory, asks whether every finite group $G$ can be realized as the Galois group of a field extension of the rational numbers. Malle's conjecture is a refined version of the inverse Galois problem which predicts the asymptotic number of such extensions.  In joint work with Ishan Levy, we prove a version of Malle's conjecture, computing the asymptotic growth of the number of Galois $G$ extensions of $\mathbb F_q(t)$, for $q$ sufficiently large and relatively prime to $|G|$. The key input is a computation of the stable cohomology of certain Hurwitz spaces.

TBA by David Kruzel

Series
Analysis Seminar
Time
Wednesday, October 28, 2026 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
David Kruzel – Georgia Institute of Technology

Second order terms in Arithmetic Statistics

Series
School of Mathematics Colloquium
Time
Thursday, October 29, 2026 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Arul Shankar – University of Toronto

Arithmetic Statistics is the study of arithmetic objects as they vary in a family. This is the framework used to analyze distributional properties of discriminants and class groups of number fields, ranks and Selmer groups of elliptic and hyperelliptic curves, low-lying zeroes and central values of L-functions, and many other key objects and invariants. An interrelated web of conjectures (Malle, Cohen--Lenstra, Poonen--Rains, Goldfeld, Katz--Sarnak, Loughran--Santens, and their many refinements) give quite precise conjectural descriptions (based on heuristical models) of the leading terms and asymptotic constants of the counts arising in these distributional questions. However, the secondary terms of the counts are much more mysterious, and very little is known (or even conjectured) about them.

In this talk, I will discuss some of the main distributional questions in arithmetic statistics, give some theoretical and practical explanations of why these secondary terms are so important, and end with explaining a series of results, joint with Manjul Bhargava, Takashi Taniguchi, and Jacob Tsimerman, in which some of these secondary terms are proved to exist, and computed.

The Gamma-disordered Aztec diamond

Series
Stochastics Seminar
Time
Thursday, October 29, 2026 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Roger Van Peski – Columbia University –

The dimer model, i.e. random perfect matchings of a bipartite graph, is a classical object about which much is known. As soon as one biases the probability measure by edge weights which are themselves random, very little is known rigorously, though physicists have studied such models for several decades and made extensive predictions. I will discuss a new integrable model in this class (the Gamma-disordered Aztec diamond) which allows us to prove results on the free energy, and also exhibits surprising relations to integrable polymer models which lead to probabilistic results on tilings. Joint work with Maurice Duits (KTH), https://arxiv.org/abs/2512.03033.