Seminar Coordinators

2026-27 SEMINARS

FALL

WINTER

SPRING

Math 208 - Algebraic Geometry

Oprea, Dragos

Oprea, Dragos

Oprea, Dragos

Math 209 - Number Theory

Popescu, Cristian

Popescu, Cristian

Popescu, Cristian

Math 211A - Algebra

Golsefidy, Alireza

Golsefidy, Alireza

Golsefidy, Alireza

Math 211B - Group Actions

TBD

TBD

TBD

Math 218 - Biological Systems

Miller, Pearson

Miller, Pearson

Miller, Pearson

Math 243 - Functional Analysis

Ioana, Adrian

Ioana, Adrian

Ioana, Adrian

Math 248 - Real Analysis

Bejenaru, Ioan

Bejenaru, Ioan

Bejenaru, Ioan

Math 258 - Differential Geometry

Zhang, Ruobing

Zhang, Ruobing Zhang, Ruobing

Math 268 - Logic

TBD

TBD

TBD

Math 269 - Combinatorics

Rhoades, Brendon & Warnke, Lutz

Rhoades, Brendon & Warnke, Lutz

Rhoades, Brendon & Warnke, Lutz

Math 278A - CCoM

Cheng, Li-Tien

Cheng, Li-Tien

Cheng, Li-Tien

Math 278B - Math of Info, Data

Webber, Robert

Webber, Robert Webber, Robert

Math 278C - Optimization

Nie, Jiawang

Nie, Jiawang

Nie, Jiawang

Math 288 A - Probability

Peca-Medlin, John

Peca-Medlin, John

Peca-Medlin, John

Math 288B - Statistics

TBD

TBD

TBD

Math 292 - Topology 

TBD

TBD

TBD

 


Upcoming Seminars

Mon, Nov 16 2026
  • 3:00 pm
    Mx. Charlie Magland - University of Washington
    Tensor Triangular Geometry for Higher Verlinde Categories

    Math 211A: Seminar in Algebra

    APM 7321

    In a groundbreaking construction, Benson, Etingof, and Ostrik introduced a family of finite incompressible symmetric tensor categories, called the higher Verlinde categories, whose tensor product is fundamentally different from vector spaces. Much about the structure of these categories is still unknown. In this talk, we describe the first few Verlinde categories in characteristic 2 by equating their objects with representations of a quiver. Ultimately we compute the Balmer Spectrum of their stable categories, a topological space classifying ideals of modules closed under the tensor product. This is joint work with Andrew Aguilar, Wolfgang Allred, and Ian Martin.

Tue, Nov 17 2026
  • 11:00 am
    Tamal Dey - Purdue University
    An Efficient Algorithm for Computing the Conley–Morse Barcode for Combinatorial Dynamical Systems

    Center for Computational Mathematics Seminar

    APM 2402 and Zoom ID 961 4627 1748

    Recent advances in combinatorial dynamical systems, extending classical discrete Morse theory, have stimulated growing algorithmic interest in combinatorial vector fields. In this context, the authors of [1] recently introduced the Conley–Morse persistence barcode, a topological summary that captures the evolution of invariant sets (Conley indices) in a changing vector field through homological persistence. In this work, we present an efficient algorithm for computing this barcode. Our approach incrementally updates the matrix decomposition R=DU used in standard persistence algorithms via a collection of suitably defined atomic operations. The correctness of the algorithm follows from a new interpretation of the transition diagram introduced in [1].

    [1] Conley–Morse Persistence Barcode: A Homological Signature of a Combinatorial Bifurcation, Tamal K. Dey, Michal Lipinsky, and Manuel Soriano-Trigueros, Foundations of Computational Mathematics (2026), to appear.

Wed, Nov 18 2026
  • 3:00 pm
    Prof. Heng Yang - Harvard University
    A Field Theory of First-Order Methods for Linear Conic Optimization

    Math 278C: Seminar in Optimization and Data Science

    Zoom (Meeting ID: 995 4559 2483 / Password: OPT278CFA2)

    First-order methods make large-scale conic optimization computationally accessible. Their convergence dynamics, however, are not well understood: some instances converge rapidly, others exhibit persistent slow progress, and still others pass through multiple plateaus before entering a fast local regime.

    In this talk, I will present a unified framework for understanding these behaviors by viewing an algorithm’s one-step update as a vector field. The central concept is region-wise sharpness, which measures the strength of this field relative to the distance to the solution set. This framework yields four new results. First, strict complementarity guarantees local field sharpness around an individual solution and linear convergence of first-order methods for semidefinite programming, without requiring nondegeneracy or uniqueness. Second, at certain singular solutions, the field has vanishing first-order variation in directions that leave the solution set; second-order limit dynamics characterize the resulting slow motion and explain several empirical signatures. Third, a field rigidity principle establishes setwise sharpness around the entire solution set for a class of exact boolean moment–sos relaxations, allowing local linear convergence even when the limiting solution fails strict complementarity. Fourth, an afterimage principle identifies slow regions through nearby optimization problems whose solution geometries differ substantially while their algorithmic fields remain close. These regions provide certificates of long convergence transients beyond the reach of local analysis.

    Complementing this analysis of convergence dynamics, i will also discuss computational advances that reduce the cost of each iteration in semidefinite programming. These include composite polynomial filtering for large-scale positive semidefinite cone projections, designed to exploit the high throughput of modern gpus, and a subsequEnt extension that improves projection accuracy through spectral deflation.

Thu, Nov 19 2026
  • 11:00 am
    Ivan Feng - USC
    Analysis of a Twisted Bose–Einstein Markov Chain with Applications to Sampling Catalan Structures

    Math 288: Probability & Statistics Seminar

    APM 6402

    In joint work with J. E. Paguyo, we analyze the twisted Bose–Einstein chain introduced by Diaconis and Zhong, determining its stationary distribution and spectrum, proving a logarithmic mixing scale, and applying it to sampling parking functions and Dyck paths. No prior knowledge of the Burnside process is assumed.

  • 2:00 pm
    Ramanujan Srihari - UC San Diego
    Values of equivariant zeta functions of varieties over finite fields

    Math 209: Number Theory Seminar

    APM 6402

    Describing the special values of zeta functions of arithmetic schemes is a classical problem in number theory which has led to several outstanding conjectures. For smooth projective varieties over finite fields, the first major progress in this direction was achieved by Milne in the 1980s. Later, Lichtenbaum (and Geisser for arbitrary varieties over finite fields) introduced modifications of the étale topology with respect to which integral motivic cohomology has better properties, and yields a more systematic description of Milne’s formula. 

    More generally, for a finite Galois cover of varieties over a finite field, one can ask for an explicit description of the values of the equivariant zeta function, in the spirit of the ETNC. In this talk we present a conjectural formula for the value of this function at any non-negative integer in terms of Galois structures of arithmetic and derived de Rham cohomology. This provides an equivariant refinement of Geisser’s formula.

Fri, Nov 20 2026
  • 10:30 am
    Beibei Liu - Ohio State University
    Divergence in the Hitchin Component

    Math 258: Seminar in Differential Geometry

    APM 6402

    The Teichmüller space of a closed surface S of genus at least two parametrizes marked hyperbolic structures on S. A higher-rank analogue is the Hitchin component for PGL(3, R), which parametrizes convex real projective structures on S. In this talk, I will discuss the deformation of Hitchin representations, focusing on how the associated geometric structures degenerate along divergent sequences in the Hitchin component. This is joint work in progress with Mitul Islam, Giuseppe Martone, and Beatrice Pozzetti.

Mon, Nov 23 2026
  • 10:30 am
    Tian Yang - Texas A&M University
    Volume Conjecture and some recent progress

    Math 288: Probability & Statistics Seminar

    APM 6402

    In this talk, I will begin with an overview of the Volume Conjecture, which reveals a surprising connection between two seemingly different approaches to three-dimensional topology: hyperbolic geometry and quantum invariants. I will then explain how probability theory enters this picture through Liouville conformal field theory, a two-dimensional quantum field theory with deep connections to the Gaussian free field and Gaussian multiplicative chaos. In recent joint work with Tianyue Liu, Shuang Ming, Xin Sun, and Baojun Wu, we construct a new family of quantum invariants of hyperbolic 3-manifolds using the fusion kernels of Liouville conformal field theory; and we prove that the asymptotic behavior of these invariants is precisely as predicted by the Volume Conjecture.

Tue, Nov 24 2026
  • 3:00 pm
    Arseniy Kryazhev - UC San Diego
    AI Safety as a Career Path: An Overview

    APM 7321

    I give a high-level overview of Technical AI Safety as a field. My goal is to leave the listeners with the impression of what it feels like to be "in AI Safety": we discuss what types of work there are, where money comes from, trajectories and timelines to stable employment/funding, how competitive the field is, etc. If you do things like Math, CS, Physics or Philosophy and aren't sure what to do in the future, you may find this interesting, even if you are annoyed by the hype, like I used to be.
    (Disclaimer: the talk will be a bit mathematician-biased and will only give a snapshot of my evolving impression.)

Wed, Nov 25 2026
  • 3:00 pm
    Prof. Ali Mohammad Nezhad - University of North Carolina
    Real Algebraic Geometry and Higher-Order Interior-Point Methods

    Math 278C: Seminar in Optimization and Data Science

    Zoom: https://ucsd.zoom.us/j/99545592483 (Meeting ID: 995 4559 2483 / Password: OPT278CFA2)

    Semi-definite programming is a fundamental class of convex optimization problems with applications ranging from combinatorial optimization and control to polynomial optimization. Interior-point methods solve such problems by following a central path toward an optimal solution, and the geometry of this path plays an important role in understanding their convergence behavior.

    In this talk, I will first give a brief introduction to semi-definite programming, some of its applications, and the central-path framework underlying interior-point methods. I will then discuss a semi-algebraic viewpoint on the central path and explain how analytic reparametrizations can be used to study its behavior near optimal solutions. This perspective leads naturally to higher-order interior-point methods and super-linear convergence results, including in settings where standard regularity assumptions such as strict complementarity may fail. Finally, I will discuss how these ideas extend beyond semi-definite programming to polynomial optimization and, more broadly, to optimization problems with o-minimal or tame structure.

Thu, Dec 3 2026
  • 4:00 pm
    Prof. Rekha R. Thomas - University of Washington
    Conformally Rigid Graphs

    Department Colloquium

    APM 6402

    A well known result in graph theory states that a graph is connected if and only if the second eigenvalue of its Laplacian matrix is positive. In fact, the larger the second eigenvalue, the more connected the graph is. By varying the weights on edges, one can in general increase the second eigenvalue which in turn affects many graph properties such as expansion, mixing times of random walks etc.

    In this talk, we will introduce conformally rigid graphs, which are those unweighted undirected graphs in which one cannot increase the second eigenvalue or decrease the largest eigenvalue by changing weights. This notion turns out to be deeply connected to graph embeddings, semidefinite programming and other ideas in geometry, optimization, representation theory and combinatorics.

    This is joint work with Joao Gouveia, Andrew Niu and Stefan Steinerberger.

Mon, Dec 7 2026