Seminars and Colloquia by Series

Maximization of recurrent sequences, Schur positivity, and derivative bounds in Lagrange interpolation

Series
Analysis Seminar
Time
Wednesday, January 14, 2026 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dmitrii OstrovskiiGeorgia Institute of Technology

Consider the following extremal problem: maximize the amplitude |X_T|, at time T, of a linear recurrent sequence X_1, X_2,... of order N < T, under natural constraints: (I) the initials are uniformly bounded; (II) the characteristic polynomial is R-stable, i.e., its roots are in the origin-centered disc of radius R. While the maximum at time T = N essentially follows from the classical Gautschi bound (1960), the general case T > N turns out to be way more challenging to handle. We find that for any triple (N,R,T), the amplitude is maximized when the roots coincide and have modulus R, and the initials are chosen to align the phases of fundamental solutions. This result is striking for two reasons. First, the same configuration of roots and initials is uniformly optimal for all T, i.e. the whole envelope is maximized at once. Second, we are not aware of any purely analytical proof: ours uses tools from algebraic combinatorics, namely Schur polynomials indexed by hook partitions. 

In the talk, I will sketch the proof of this result, making it as self-sufficient as possible under the circumstances. If time permits, we will discuss a related conjecture on the optimal error bounds in complex Lagrange interpolation.

The talk is based on the work https://arxiv.org/abs/2508.13554.

Fantastic Path RND and find them in diffusion control

Series
Applied and Computational Mathematics Seminar
Time
Tuesday, December 9, 2025 - 13:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jiajun HeUniversity of Cambridge

Please Note: Note the special time/date. Speaker will be in person.

I will begin by introducing the concept of path Radon–Nikodym derivative (path RND) and explaining how it connects to, and accelerates, classical sampling and estimation algorithms such as parallel tempering and free-energy perturbation. I will then show how path RND offers a unifying perspective on controlling diffusion models using Sequential Monte Carlo. Finally, I will present a new paradigm for inference-time control based on parallel tempering, which enables more robust manipulation of diffusion trajectories.

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.

Learning Theory of Transformers -- An Operator Learning Viewpoint

Series
SIAM Student Seminar
Time
Friday, December 5, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Clough 125
Speaker
Peilin LiuUniversity of Sydney
To study the underlying mechanisms behind transformers and related techniques, we propose a transformer learning framework motivated by a two-stage sampling process, with distributions being inputs, and present a mathematical formulation of the attention mechanism as kernel embedding. Our findings show that by the attention operator, transformers can compress distributions into function representations without loss of information. We also demonstrate the in-context learning capabilities of efficient transformer structures through a rigorous generalization analysis.

Computer Algebra club/seminar

Series
Additional Talks and Lectures
Time
Thursday, December 4, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Daniel Hwang and Juliet WhiddenGeorgia Tech

Please Note: We will start with a presentation by Daniel Hwang and Juliet Whidden and continue with a free discussion.

Pages