Calendar

Time interval: Events:

Monday, October 19, 2026

Posted October 16, 2026

Informal Combinatorics Seminar

2:30 pm – 3:30 pm Lockett 233

Sean Boros, Louisiana State University
Hailey Jay Garcia, Louisiana State University
SageMath for Combinatorialists

SageMath is a free, open-source computer algebra system. In this workshop, we'll tour what it offers combinatorialists (focusing on graphs and matroids), then split into small groups to get hands-on experience. No experience or install of Sage or Python is needed. Bring a laptop.

Event contact: jgarc86@lsu.edu

Tuesday, October 20, 2026

Posted September 29, 2026

Computational Mathematics Seminar

3:30 pm – 4:20 pm LDMC, Room 1034

Mansur Shakipov, University of Houston
A Stokes–Cahn–Hilliard Model of a Phase-Separated Fluid Membrane: Analysis and Discretization

We study the surface Stokes–Cahn–Hilliard system governing tangential flow and phase separation in viscous fluid membranes. The equations are posed on a closed stationary surface embedded in 3D. We first address the questions of well-posedness, continuous dependence and higher-regularity. We then propose an unfitted finite element method with a novel stabilization term that eliminates spurious velocity components associated with Killing fields in the numerical solution. Assuming geometric exactness, we derive error estimates in the energy and L2 norms for the spatially-discrete method. Finally, we explore the model computationally.

Event contact: Shawn Walker

Wednesday, October 21, 2026

Posted August 26, 2026
Last modified October 16, 2026

Informal Analysis Seminar Questions or comments?

12:30 pm – 1:20 pm Lockett 233

Sayandeep Sarkar, Louisiana State University
Specular reflection limits of the confined Vlasov-Boltzmann equation

In In this talk, we continue our study of the Boltzmann equation, focusing on the behavior of gas particles under different boundary conditions. One important boundary condition is specular reflection, which describes how particles bounce off a solid wall while preserving their speed. We consider a different approach to modeling this behavior by introducing a Vlasov-type potential into the Boltzmann equation. Instead of imposing a reflecting boundary directly, we use a strong potential barrier that pushes particles back into the domain. As the potential barrier becomes stronger, we expect the particles to behave increasingly like those undergoing specular reflection. Our main goal is to study how the solution of this modified Vlasov–Boltzmann equation converges to the solutions of the classical Boltzmann equation with specular reflection boundary conditions. We discuss the mathematical ideas behind this convergence, beginning with a simple half-space domain and considering possible extensions to more general domains.

Event contact: Laura Kurtz


Posted September 15, 2026
Last modified October 14, 2026

Geometry and Topology Seminar Seminar website

1:30 pm – 2:30 pm Lockett 233

Emily Stark, Wesleyan University
Rigidity for hyperbolic groups with Pontryagin sphere boundary

The Pontryagin sphere is a homogeneous, nowhere planar, compact 2-dimensional fractal constructed as an inverse limit of closed orientable surfaces. The Pontryagin sphere arises naturally as the boundary at infinity of the fundamental group of a 3-dimensional hyperbolic pseudo-manifold. We prove that if the conformal dimension of the boundary is less than four, then such a group is action rigid: if it acts geometrically on the same proper metric space as another group, then the groups are virtually isomorphic. A key component of the proof is a generalization of Yang's Theorem regarding the structure of p-adic actions on a tree of manifolds. This is joint work with Chris Cashen, Pallavi Dani, and Kevin Schreve.

Event contact: Kevin Schreve


Posted August 27, 2026
Last modified October 17, 2026

Informal Geometry and Topology Seminar Questions or comments?

3:30 pm Lockett Hall 233

Huong Vo, Louisiana State University
Whitehead complexes and free splittings

In this talk, I will introduce the Whitehead complex constructed from a non-positively curved cube complex. The Whitehead complex can then be used to detect the free splittings of the cube complex's fundamental group.


Posted October 18, 2026

Harmonic Analysis Seminar

3:30 pm – 4:30 pm Lockett 232

Vishwa Dewage, University of Vienna, Vienna, Austria
Quantum harmonic analysis on the weighted Bergman space of a bounded symmetric domain

In Werner's Quantum harmonic analysis (QHA) we develop notions in classical harmonic analysis, such as convolutions and the Fourier transform for operators in place of functions. In this work, we set up QHA on the weighted Bergman space of a bounded symmetric domain, where Toeplitz operators and Berezin transforms arise naturally as convolutions. Using the $\alpha$-Berezin transform, we obtain a characterization of Toeplitz operators and approximation results by Toeplitz operators, including a description of the radial Toeplitz algebra. We then introduce invariant differential operators that act on operators on the Bergman space. A key role is played by an explicit invariant differential operator that shifts the $\alpha$-Berezin transform, which leads to a discrete heat-type equation and a further characterization of the radial Toeplitz algebra through its domain. This is joint work with Matthew Dawson and Gestur Ólafsson.

Friday, October 23, 2026

Posted October 19, 2026

Combinatorics Seminar Questions or comments?

10:00 am – 11:00 am Zoom

George Brooks, University of South Carolina
Intersecting Families in the $\ell_2$-norm

A family of sets $\mathcal{F} \subset \binom{[n]}{k}$ is intersecting if $F \cap F' \neq \emptyset$ for every $F, F' \in \mathcal{F}$. The Erd\H{o}s-Ko-Rado theorem is a classical result in extremal set theory which determines the maximum size of an intersecting family of $k$-sets. A family of sets $\mathcal{F}$ is nontrivial if $\bigcap_{F \in \mathcal{F}} F = \emptyset$, i.e. the sets do not share a common element. The Hilton-Milner theorem determines the maximum size of a nontrivial intersecting family of $k$-sets. In this talk, I will revisit both extremal questions through the lens of the codegree squared sum $\operatorname{co}_2(\mathcal{F}) = \sum_{J \in \binom{[n]}{k-1}} d(J)^2$, where the codegree $d(J)$ is the number of sets in a family $\mathcal{F}$ containing the $(k-1)$-set $J$. This is joint work with William Linz.


Posted October 22, 2026

LSU AWM Student Chapter LSU AWM Student Chapter Website

12:30 pm – 1:30 pm Monday, October 23, 2006 Keiser Lounge, Lockett 3rd floor

Brown Bag Lunch and Presentation from the Office of Fellowships

The Office of Fellowships will introduce two opportunities of particular interest to STEM students. If you are interested in learning about how the office of fellowships can be of assistance to you, please join us to learn more and connect with the Office of Fellowships.

Event contact: Laura Kurtz, lkurtz2@lsu.edu


Posted October 30, 2026

Deep Learning Seminar

12:30 pm – 1:30 pm Coates 236

Benjamin Fehrman, Louisiana State University
A first universal approximation theorem

Event contact: Benjamin Fehrman


Posted October 22, 2026

AI in Mathematics Seminar

3:30 pm – 4:30 pm Lockett 232

AI in Mathematics: Informal Lab Session

There will be no new talk or material this week. Instead, we'll keep our usual meeting time open for anyone who would like to experiment with the AI tools and techniques introduced in previous sessions.

Event contact: Keegan Kirk

Saturday, October 24, 2026

Posted October 23, 2026

Conference

8:45 am Lockett 232

Mini-Workshop on Harmonic Analysis

Speakers: Vishwa Dewage (Vienna University), Junyuan Fang, Hongki Jung, Jiaqi Hou, Yaghoub Rahimi, Yunlei Wang, Kiseok Yeon (UC Davis), Laurence Wijaya (University of Kentucky). See https://www.math.lsu.edu/~ha2026/ for the schedule and titles of talks.

Event contact: Rui Han, Xiaoqi Huang, Gestur Olafsson, Manasa Vempati, Fan Yang

Monday, October 26, 2026

Posted October 23, 2026

Probability Seminar Questions or comments?

2:00 pm – 3:00 pm Click here to attend on Zoom

Milton Jara, IMPA, Brazil
Scaling limit of a population model with age

Consider the following simple dynamics. We start with a semi-infinite binary vector ((\ldots,X_{-1},X_0)). At each step, we draw a geometric random variable (Z), look (Z) steps into the past, and copy the bit we see at that position. This dynamics can be interpreted as a modification of the Moran model, in which the probability that an individual passes a trait (represented by a binary bit) to a given descendant is a function of its age and decays exponentially in time. When the parameter of the geometric random variable converges to 1, we show that the expected future value of the trait converges to a solution of the Wright–Fisher equation. For suitable generalizations of this model, we show that their scaling limits are given by solutions of the Fleming–Viot equation. Joint work with Eldon Barros and Eric Santana (IMPA).

Event contact: Yangrui Xiang


Posted October 25, 2026

Informal Combinatorics Seminar

2:30 pm – 3:30 pm Lockett 233

Weihao Xia, Louisiana State University
Introduction to Directed Graphs and Tournaments

We will give a brief introduction to directed graph theory, starting with basic definitions, degrees, paths, cycles, and connectivity. We will then discuss several important properties and classes of directed graphs, with a particular focus on tournaments and their Hamiltonian paths and cycles. We will explore classical results on pancyclicity in regular tournaments and extend our discussion to multipartite tournaments.

Event contact: jgarc86@lsu.edu

Tuesday, October 27, 2026

Posted September 28, 2026
Last modified October 22, 2026

Algebra and Number Theory Seminar Questions or comments?

3:00 pm – 4:00 pm Lockett 233 or click here to attend on Zoom

Yifeng Huang, Emory University
Rogers--Ramanujan identities from singular curves

The first Rogers—Ramanujan identity $$\sum_{n\ge 0} \frac{q^{n^2}}{(1-q)(1-q^2)\cdots (1-q^n)}=\prod_{i\ge 1, i\equiv 1,4\pmod 5} (1-q^i)^{-1}$$ is an ``infinite sum=infinite product'' identity. Combinatorially, it means that partitions of $n$ with gaps between adjacent parts at least two are as many as partitions of $n$ whose parts are congruent to 1 or 4 modulo 5. Much less known is that the identity also counts zero-dimensional sheaves on the cuspidal curve $X^2=Y^3$, obtained in an earlier work with Jiang. In recent joint works with Jiang and Oblomkov and with Lau and Ono, we show that this phenomenon extends to any coprime $a,b$, resulting in infinitely many new Rogers—Ramanujan identities. It uses a wide range of ingredients, from Quot scheme of points, quiver representations, and poset flag varieties used in the geometric computation, to cylindric partitions, symmetric functions, and compositional rational shuffle theorem used in the proof of the new identities

Wednesday, October 28, 2026

Posted August 26, 2026
Last modified October 23, 2026

Informal Analysis Seminar Questions or comments?

12:30 pm – 1:20 pm Lockett 233

Majid Abubakar, Louisiana State University
Asymptotic and Non-asymptotic Analysis of Ergodic Jump Diffusion systems

Estimating integrals with respect to the stationary distribution of a Markov process X typically relies on time-averaged integrals. In many practical scenarios, such as when X is defined by a SDE with jumps, these integrals lack a closed-form solution, necessitating the use of a discretized process. This discrepancy is particularly pronounced in jump-diffusion settings. We establish convergence results and Central Limit Theorems for these time-inhomogeneous integrals, and present concentration inequalities that demonstrate non-asymptotic, exponential decay of error probabilities.

Event contact: Laura Kurtz


Posted September 15, 2026
Last modified October 13, 2026

Geometry and Topology Seminar Seminar website

1:30 pm – 2:30 pm Lockett 233

Colby Kelln, University of Minnesota
Filling flatly fibered cusps of hyperbolic $n$-manifolds 

Dehn filling is a classical tool for producing negatively curved manifolds from cusped hyperbolic 3-manifolds, and results of Mosher-Sageev and Fujiwara-Manning extend this idea to higher dimensions when cusp cross sections are tori. In this talk, I will discuss a generalization to hyperbolic manifolds whose cusps can have more complicated cross sections---ones that admit a Riemannian submersion onto a flat base with totally geodesic fiber. Filling along the fibers of such a cusp can still produce a nonpositively (and in some cases negatively) curved space, provided that the fibers have large enough systole. Group theoretically, this filling takes a relatively hyperbolic fundamental group and creates a related hyperbolic one. I'll introduce the Ratcliffe-Tschantz hyperbolic 5-manifold, whose cusps are bundles with Hantzsche-Wendt fiber over the circle, and show how the filling result, coupled with some group theory, gives information about the geometry of its cusps.

Event contact: Jagerynn Ting Verano


Posted August 27, 2026
Last modified October 25, 2026

Informal Geometry and Topology Seminar Questions or comments?

3:30 pm Lockett Hall 233

Krishnendu Kar, Louisiana State University
Skein reduction and stabilization for the odd Khovanov spectra of T(2,m) ⊔ T(2,n)

Lipshitz and Sarkar refined Khovanov homology to a stable homotopy type: for each quantum grading, a finite spectrum whose cohomology is Khovanov homology. Sarkar, Scaduto and Stoffregen constructed the corresponding spectra for odd Khovanov homology. For a split link, the even spectrum is a smash product of the spectra of its pieces (Lawson--Lipshitz--Sarkar). The odd spectrum is not. By computations of Sch\"utz and a theorem of Rajapakse, the odd spectrum of $T(2,3)\sqcup T(2,3)$ in quantum grading $14$ contains a suspension of $\mathbb{CP}^2$, a summand not known to occur in any even Khovanov spectrum. How often does $\mathbb{CP}^2$ appear? For $T(2,m)\sqcup T(2,n)$, the odd spectrum in each quantum grading $q$ is a wedge of spheres and $\nu$ copies of a suspension of $\mathbb{CP}^2$, and homology cannot see $\nu$. Using the skein cofiber sequence at the level of spectra, I will show that $\nu$ vanishes in five quantum gradings, reduces to finitely many small links for fixed $q-m-n$, and stabilizes as $m$ and $n$ grow. In particular, the $\mathbb{CP}^2$ summand persists in grading $m+n+8$ for all $m,n\ge 3$.


Posted August 27, 2026
Last modified November 2, 2026

Informal Geometry and Topology Seminar Questions or comments?

3:30 pm Lockett Hall 233

Michael Young, Louisiana State University
TBD

TBD

Thursday, October 29, 2026

Posted September 21, 2026
Last modified October 27, 2026

LSU SIAM Student Chapter

12:00 pm – 1:00 pm Keisler Lounge

Helen Moore, University of Florida
Counterintuitive Optimization for Airplanes and Medicines: How to Improve Patient Outcomes Using Mathematics

: Finding a treatment regimen that increases median patient survival time by 5% means extra time with loved ones for patients. It can also mean the difference between clinical trial success and failure for a new therapy. In the past, trial and error was used to find treatment regimens that yield better patient outcomes. Now we have mechanistic mathematical models of disease-therapy dynamics that can help. Optimization methods can predict regimens expected to achieve the best outcomes; these regimens can then be tested experimentally and clinically. This can be especially helpful when there are many possible different combinations to consider, or when optimal regimens are counterintuitive. I will make the case that counterintuitive solutions can be best in the real world, for both airplanes and treatment regimens, and that we may be missing out on substantial patient benefit when we don’t calculate optimal regimens for our disease models.


Posted October 21, 2026

Colloquium Questions or comments?

3:30 pm Lockett 232

Gunter Stolz, University of Alabama at Birmingham
Speed Limits for Quantum Walks in Electric Fields

Quantum walks can be motivated in at least two different ways. For one, they are the one-particle sector restrictions of quantum cellular automata (QCAs), a model used in quantum computing. Also, quantum walks are a quantum mechanical analog of classical random walks. However, while the latter have diffusive dynamics, quantum walks typically spread ballistically, i.e. they have positive velocity. We will discuss two ways to mathematically describe their propagation velocity. In particular, we will show that an exterior periodic electric field can slow down the velocity exponentially in the period of the field. This means that the field localizes the walk for long times, which thus behaves as an insulator. This is joint work with Houssam Abdul-Rahman (Arabic Emirates), Christopher Cedzich (Hagen, Germany) and Albert Werner (Copenhagen).

Friday, October 30, 2026

Posted September 21, 2026

Control and Optimization Seminar Questions or comments?

10:30 am – 11:20 am Zoom: https://lsu.zoom.us/j/98176468969

Tim Hoheisel, McGill University, Canada
A Computational Framework for Linear Inverse Problems via the Maximum Entropy on the Mean Method

We present a framework for solving linear inverse problems that is computationally tractable and has mathematical certificates. To this end, we interpret the ground truth of a linear inverse problem as a random vector with unknown distribution. We solve for a distribution which is close to a prior P (guessed or data-driven) measured in the KL-divergence while also having an expectation that yields high fidelity with the given data that defines the problem. After reformulation this yields a strictly convex, finite dimensional optimization problem whose regularizer, the MEM functional, is paired in duality with the log-moment generating function of the prior P. We exploit this computationally via Fenchel-Rockafellar duality. When no obvious guess for P is available, we use data to generate an empirical prior. Using techniques from variational analysis and stochastic optimization, we show that, and at what rate, the solution of the empirical problems converges (as the sample size grows) to the solution of the problem with known prior. Moreover, we show how stochastic subgradient methods can be brought to bear on the MEM dual. This is joint work with Rustum Choksi (McGill), Matthew King-Roskamp (McGill), and Gabriel Rioux (Imperial College).


Posted October 22, 2026

LSU AWM Student Chapter LSU AWM Student Chapter Website

12:30 pm – 1:30 pm Keisure Lounge, Lockett 3rd floor

Lunch and QA with Dr Marilyn Carlson

AWM is hosting a QA session with Dr. Marilyn Carlson, a professor in the School of Mathematical and Statistical Sciences at Arizona State University (ASU). She is the recipient of the 2027 AWM Louise Hay Award for Contributions to Mathematics Education. Her contributions have largely centered on undergraduate mathematics and had significant impact for students and instructors. Join us to chat about undergraduate mathematics education with Dr. Carlson. Lunch is provided.

Event contact: Laura Kurtz, lkurtz2@lsu.edu


Posted October 22, 2026

LSU AWM Student Chapter LSU AWM Student Chapter Website

12:30 pm – 1:30 pm Keisure Lounge, Lockett 3rd floor

Lunch and QA with Dr Marilyn Carlson

AWM is hosting a QA session with Dr. Marilyn Carlson, a professor in the School of Mathematical and Statistical Sciences at Arizona State University (ASU). She is the recipient of the 2027 AWM Louise Hay Award for Contributions to Mathematics Education. Her contributions have largely centered on undergraduate mathematics and had significant impact for students and instructors. Join us to chat about undergraduate mathematics education with Dr. Carlson. Lunch is provided.

Event contact: Laura Kurtz, lkurtz2@lsu.edu


Posted October 30, 2026

Deep Learning Seminar

12:30 pm – 1:30 pm Tuesday, October 20, 2026 Coates 236

Benjamin Fehrman, Louisiana State University
Universal approximation of neural nets with bounded width

Event contact: Benjamin Fehrman


Posted October 27, 2026

Combinatorics Seminar Questions or comments?

2:30 pm – 3:30 pm Zoom

Lily Clifton, Auburn University
Unbreakable Quasi-graphic Matroids

The class of quasi-graphic matroids generalizes the classes of frame and lifted-graphic matroids. A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M. We generalize and strengthen recent work of Fife, Mayhew, Oxley, and Semple to characterize the underlying graphs of unbreakable quasi-graphic matroids. We also show that when a quasi-graphic matroid is not a frame or a lifted-graphic matroid and fails to be 3-connected, it is never unbreakable.


Posted October 27, 2026

AI in Mathematics Seminar

3:30 pm – 4:30 pm Lockett 232

How Should We Evaluate Graduate Students in the Age of AI?

If AI can solve homework problems, write computer programs, and help develop mathematical proofs, how can we tell what a graduate student really knows? What should students be expected to do independently? How should we evaluate creativity, mathematical understanding, and research potential? And how do graduate students themselves feel about these questions? In this interactive seminar, we'll explore these issues while demonstrating a technique called indirect prompting. We'll use AI to help turn a group discussion into a thoughtful report: We will use an initial discussion to generate questions that deepen the conversation, identify points of agreement and disagreement, and help participants develop their ideas. The answers to those questions will then help us build a report reflecting the views of faculty and graduate students. The report will help us prepare a grant proposal for an SEC-wide Leadership Conference on graduate education in the age of AI. No programming or technical AI expertise is required.

Event contact: Scott Baldridge

Monday, November 2, 2026

Posted October 31, 2026

Informal Combinatorics Seminar

2:30 pm – 3:30 pm Lockett 233

Joy Harris, Louisiana State University
Equitable Graph Colorings

Say that we are running a factory and we need to assign workers to tasks within that factory. In order to avoid cross contamination, we specify that certain pairs of tasks should not be completed by the same worker. We can think of the tasks as the vertices of a graph, and pairs of tasks that are incompatible will have an edge between them. Now color each vertex based on which worker we have assigned to the task. Ideally, we want that none of the tasks assigned to the same worker are incompatible, i.e. none of the vertices of the same color have an edge between them. This is exactly the idea behind a proper vertex coloring of a graph. Let's add an extra condition. It's not fair to one worker if they must work twice as many tasks as their peers. We specify that each worker must be assigned to the same amount of tasks, give or take one. In the graph, this means that each vertex color class must be the same size, give or take one vertex. We have now entered the world of equitable vertex graph colorings. We will see how equitable graph vertex colorings differ from vertex colorings, discuss the Chen-Lih-Wu conjecture and what's known, and then prove some basic results that give the flavor of the methods used in the proof of the conjecture.

Event contact: jgarc86@lsu.edu

Wednesday, November 4, 2026

Posted August 26, 2026
Last modified November 2, 2026

Informal Analysis Seminar Questions or comments?

12:30 pm – 1:20 pm Lockett 233

Jackson Knox, Louisiana State University
Discretization for the Analysis of Continuous-Time Dynamical Systems

The discretization method is sometimes relevant to the analysis of systems in continuous time. In the case of linear systems, the fundamental matrix can be used to obtain discrete-time representations of the continuous-time system, and the resulting discrete-time system may be more approachable for analysis. In this talk, we use the discretization method to address the stability of closed-loop feedback control systems using the sample-and-hold approach, wherein a linear feedback control is implemented in a piecewise-constant way. We will additionally consider the possibility of bounded perturbations in the dynamics, and we will also discuss the applicability of a discrete-time Lyapunov theorem variant to the analysis of the discretized system.

Event contact: Laura Kurtz


Posted September 25, 2026
Last modified October 17, 2026

Geometry and Topology Seminar Seminar website

1:30 pm – 2:30 pm Lockett 233

Steven Clontz, University of South Alabama
Database-Driven Mathematical Inquiry in Topology

Recent advances in computing have changed not only the nature of mathematical computation, but mathematical proof and inquiry itself. While artificial intelligence and formalized mathematics have been the major topics of this conversation, this talk will explore another class of tools for advancing mathematics research: databases of mathematical objects that enable semantic search, particularly the π-Base community database of topological counterexamples

Thursday, November 5, 2026

Posted October 16, 2026

Student Colloquium

10:30 pm TBD

Steven Clontz, University of South Alabama
Accessible and Interactive Mathematical Documents for Instruction

Beginning April 26, 2027, all public universities will be required to ensure digital documents posted online must be accessible to screenreader users. Compliance with the Americans with Disabilities Act can be quite tricky in mathematics, given our reliance on intricate formulas and graphics, and even interactive elements such as code or three-dimensional renders, for research and education. In this talk we will explore three particular tools for meeting this upcoming accessibility requirement: PreTeXt, Prefigure, and Doenet.

Friday, November 6, 2026

Posted September 30, 2026

Control and Optimization Seminar Questions or comments?

10:30 am – 11:20 am Zoom: https://lsu.zoom.us/j/98176468969

Daniel Wachsmuth, University of Wuerzburg, Germany
Solution Algorithms for Nonsmooth Optimal Control Problems Based on the Pontryagin Maximum Principle

The talk is motivated by optimal control problems for partial differential equations. The main interest is in problems that involve integral functions of the type \[\int_\Omega g(u(x)) \ dx,\] where $g : \mathbb R \to \mathbb R$ is nonsmooth and nonconvex, and $u$ is the control variable. Examples involve $L^{\scriptscriptstyle r}$-pseudonorms with $r\in [0,1)$ or problems with the constraint $u(x) \in \mathbb Z$ for $x\in \Omega$. Due to the nonconvexity of $g$, the existence of solutions in $L^{\scriptscriptstyle p}$-spaces cannot be proven. Local solutions (if they exist) can be proven to satisfy the Pontryagin maximum principle. A distinctive feature of this result is that no differentiability with respect to the control variable $u$ is required. The maximum principle serves as a starting point to develop an implementable solution algorithm. We prove that the residual in the maximum principle vanishes along the iterates produced by the algorithm. Under additional assumptions, the iterates are a minimizing sequence.


Posted November 2, 2026

Combinatorics Seminar Questions or comments?

2:30 pm – 3:30 pm Zoom

Jessica McDonald, Auburn University
Achieving Steffen’s Edge-Colouring Bound

We discuss the structure of graphs achieving known upper bounds for edge-colouring. In particular we focus on an upper bound of Steffen, and are able to prove that, under some mild assumptions, all critical graphs achieving the bound are so-called odd ring graphs. This is joint work with G. Chen, A. Fiujlaali, and A. Johnson-Yu

Monday, November 9, 2026

Posted November 16, 2026

Informal Combinatorics Seminar

2:30 pm – 3:30 pm Lockett 233

Peter Wicks Stringfield, Louisiana State University
The Knaster-Tarski-Davis Fixed Point Theorem

A lattice \(L\) is complete if and only if each order-preserving maps \(L \to L\) has a complete lattice of fixed points, hence in particular has a least fixed point. We hope to provide some motivating applications and aim to sketch the proof: one implication (complete \(\Rightarrow\) everyone has fixed points) by a classic exercise in order theory due to Knaster and Tarski; the other more (incomplete \(\Rightarrow\) someone has lacks a fixed point) more technical and due to Davis.

Event contact: jgarc86@lsu.edu

Tuesday, November 10, 2026

Posted August 22, 2026
Last modified November 8, 2026

Algebra and Number Theory Seminar Questions or comments?

2:30 pm – 3:30 pm Lockett 233 or click here to attend on Zoom

Isabella Negrini, University of Toronto
RM periods and Petersson pairings for rigid cocycles

Rigid cocycles, introduced by Darmon and Vonk in 2017, offer a promising framework to extend complex multiplication theory to real quadratic fields, suggesting a theory of "real multiplication." They exhibit striking parallels with modular forms and are central to the emerging p-adic Kudla program. In this talk, I will present joint work in progress with Hassan and Vatsal, in which we define RM periods for rigid cocycles and show how these periods naturally give rise to pairings on rigid cocycles, analogous to the classical Petersson inner product on modular forms.

Event contact: Gene Kopp


Posted November 4, 2026
Last modified November 5, 2026

Colloquium Questions or comments?

3:30 pm

Yi Han, Massachusetts Institute of Technology
What Shapes a Random Spectrum?

A large Ginibre matrix fills a disk uniformly with its eigenvalues. A polynomial in several such matrices can produce a very different shape. I will present my work on Brown measure convergence for polynomials in independent complex Ginibre matrices. The proof decomposes a linearization into algebraically irreducible pieces, yielding high-probability lower bounds of the form (N^{-C}) for the least singular value.

I will then present a new approach to inhomogeneous non-Hermitian spectra through direct comparison of logarithmic determinants and transfer-matrix methods, with applications to circular laws at arbitrarily slowly growing bandwidth.

I will also discuss an answer, in unfolded coordinates, to Bourgain’s question about Poisson eigenvalue statistics for one-dimensional Anderson–Bernoulli operators. I will close with uniqueness in law for the scalar stochastic heat equation with uniformly nondegenerate diffusion coefficients of every positive Hölder exponent.

Wednesday, November 11, 2026

Posted August 26, 2026

Informal Analysis Seminar Questions or comments?

12:30 pm – 1:20 pm Lockett 233

Ruben Acevedo Acevedo, Louisiana State University
TBD (Spectral Theory)


Posted September 15, 2026
Last modified November 1, 2026

Geometry and Topology Seminar Seminar website

1:30 pm – 2:30 pm Lockett 233

Federico Galetto, Cleveland State University
Homology of Vietoris-Rips complexes of hypercube graphs

The Vietoris-Rips complex of a point set in a metric space is the simplicial complex of finite subsets of the point set whose elements have mutual distance less than or equal to a given parameter. Our point set is the set of vertices of a hypercube graph equipped with the Hamming distance, and the resulting simplicial complex is symmetric under the action of the automorphism group of the hypercube graph. I will illustrate how this symmetry can be used to compute the homology of some of these Vietoris-Rips complexes. This is joint work with Jonathan Montaño and Zoe Wellner.

Event contact: Christin Bibby


Posted November 4, 2026
Last modified November 5, 2026

Colloquium Questions or comments?

3:30 pm

Joe Jackson, University of Chicago
The Mean-Field Limit of Online Stochastic Vector Balancing

This talk will be about recent joint work with Christian Fiedler, Daniel Lacker, and Jonathan Niles-Weed, in which we derive a mean-field scaling limit for a class of combinatorial optimization problems. In particular, we study a stochastic online version of the vector balancing problem: $n$ independent Gaussian random vectors $\mathbf{\zeta}(1),\dots,\mathbf{\zeta}(n) \sim \mathcal{N}(0,I_n)$, each of dimension $n$, arrive one at a time. The goal is to choose signs $\varepsilon(1),\dots,\varepsilon(n) \in \{-1,1\}$, with $\varepsilon(k)$ depending only on $\mathbf{\zeta}(1),\dots,\mathbf{\zeta}(k)$, so as to minimize the expected $\ell^\infty$ norm of the signed sum $\frac{1}{\sqrt{n}}\sum_{k=1}^n \varepsilon(k)\mathbf{\zeta}(k)$. Prior work showed that the optimal value $V^n$ is $O(1)$, at least for vectors with independent Rademacher entries, by constructing and analyzing specific algorithms. Our main contribution is to prove that $V^n$ converges and to characterize its limit $V^\infty$ as the value of a nonstandard stochastic control problem of mean-field type.


Posted August 27, 2026
Last modified November 9, 2026

Informal Geometry and Topology Seminar Questions or comments?

3:30 pm Lockett Hall 233

Yongho Lee, Louisiana State University
Resonance of type C toric arrangements

We determine the structure of the first resonance variety of the cohomology ring of the complement of the type C toric arrangement.

Thursday, November 12, 2026

Posted November 2, 2026
Last modified November 10, 2026

Applied Analysis Seminar Questions or comments?

1:30 pm – 2:30 pm Lockett 233

Zhongkai Tao, IHES
Escape of mass for finite-area hyperbolic surfaces

On a finite-area hyperbolic surface with cusps, we prove that L^2 eigenfunctions cannot concentrate too much deep in the cusps as the eigenvalue goes to infinity. For arithmetic surfaces, a stronger estimate was known due to Soundararajan. Our result uses the nonlinear uncertainty principle developed by Cohen and Dyatlov. This is joint work with Alex Cohen and Zhenhao Li.


Posted November 4, 2026
Last modified November 6, 2026

Colloquium Questions or comments?

3:30 pm

Erik Bates, North Carolina State University
Longest convex chains...a new universality class?

In the study of random growth processes, a foundational model is the longest-increasing-subsequence problem: from $n$ independent uniform points in the unit square, find the longest chain whose horizontal and vertical coordinates are both increasing. It is known that the maximal length is asymptotically $2n^{1/2}$, and the longest chain concentrates near the diagonal line $y=x$. In this talk, we add a geometric constraint: the chain must be convex. I will discuss the history of this problem, why I care about it, and what we know so far from recent joint work with Arnab Sen.


Posted October 28, 2026

LSU SIAM Student Chapter

4:00 pm – 6:00 pm TIAMS-4th Floor of Interdisciplinary Science Building

Applied Math Social

Do you use math in your research? Whether you're modeling populations, training neural nets, or running statistics on lab data, join LSU's Society for Industrial and Applied Mathematics (SIAM) on November 12th at 4 PM for an evening of games, food, and networking with people across campus who put math to work. It's a chance to meet potential collaborators and trade research ideas. Grad students, postdocs, faculty, and curious undergrads from all fields are welcome.(This is an interdisciplinary event for many departments.)

Friday, November 13, 2026

Posted September 21, 2026
Last modified November 3, 2026

Control and Optimization Seminar Questions or comments?

10:30 am – 11:20 am Zoom: https://lsu.zoom.us/j/98176468969

Radu Bot, University of Vienna
Continuous- and Discrete-Time Methods in Convex Optimization and Monotone Inclusions

In this talk, we explore the interplay between continuous-time and discrete-time models for solving convex optimization problems and monotone inclusions. We discuss strategies for achieving faster convergence rates across the different settings, as well as issues related to the convergence of trajectories and iterates.


Posted November 9, 2026

Combinatorics Seminar Questions or comments?

2:30 pm – 3:30 pm Zoom

Ruth Luo, University of South Carolina
The Turan number of Berge paths in connected hypergraphs

A Berge path in a hypergraph is an alternating sequence of distinct vertices and edges $v_1,e_1, v_2, \ldots, e_{k-1}, v_{k}$ such that $v_i, v_{i+1} \in e_i$ for all $i \in [k-1]$. Gy\H{o}ri, Katona, and Lemons determined the maximum number of edges in $r$-uniform, $n$-vertex hypergraphs without Berge paths on $k$ vertices. The extremal examples for their bounds are disconnected hypergraphs in which each component has either too few edges or too few vertices to contain such a Berge path. We consider the setting in which the host hypergraph is connected. The maximum number of edges in $r$-uniform connected hypergraphs without Berge paths on $k$ vertices was determined by Zhang, Broersma, Győri, Tompkins, Wang for $k \leq r+2$, and Zhao, Gerbner, Zhou for $k \geq 2r+2$. In this paper, we resolved the remaining cases $r+3 \leq k \leq 2r+1$ when $n$ is sufficiently large, confirming a conjecture of Zhang, et al. This is joint work with Yupei Li.

Monday, November 16, 2026

Posted November 16, 2026

Informal Combinatorics Seminar

2:30 pm – 3:30 pm Lockett 233

Fabian Espinoza de Osambela, Louisiana State University
The Combinatorics of Symmetric Elliptic Subcovers of Genus-Two Curves

When can a map from a genus-two curve onto an elliptic curve be compatible with an automorphism of the curve, and how many such maps are there? I will start from Riemann surfaces and branched covers. A Riemann–Hurwitz count shows that every such map has exactly one special point. It follows that only two symmetries can occur, one of order four and one of order three, and that the elliptic curve must be one of the two with extra automorphisms. Dividing by the symmetry turns each map into a cover of the sphere branched over three points, that is, into a pair of permutations with prescribed cycle types. The geometry then counts these pairs: the answer is a class number, and in prime degree p it is (p∓1)/4 or (p∓1)/6. 

Event contact: jgarc86@lsu.edu


Posted November 4, 2026
Last modified November 7, 2026

Colloquium Questions or comments?

3:30 pm

Thomas Hameister, Boston College
L-functions, and relative fundamental lemmas via Hitchin systems

Period integrals are arithmetic invariants that can be extracted from automorphic forms. A classical observation is that the period of an automorphic form is often related to the central value of an L-function. The relative Langlands program of Ben-Zvi, Sakellaridis, and Venkatesh interprets this matching of periods and L-functions as a duality between certain Hamiltonian G-varieties. In this talk, I will survey a more geometric side of their conjectures by interpreting periods and L-functions as sheaves on the moduli space of Higgs bundles. This duality refines conjectures of Nigel Hitchin and Davide Gaiotto from mirror symmetry. As an application of the resulting geometry, I will discuss some aspects of the proof of a relative fundamental lemma, an arithmetic identity arising from p-adic harmonic analysis whose proof is entirely geometric. This is based on joint works with Benedict Morrissey and Zhilin Luo and with Spencer Leslie.

Today, Tuesday, November 17, 2026

Posted September 20, 2026
Last modified November 15, 2026

Algebra and Number Theory Seminar Questions or comments?

2:30 pm – 3:30 pm Lockett 233 or click here to attend on Zoom

Ngoc Trinh Le, Tulane University
Relations between higher level Hurwitz class numbers

We connect generalizations of the classical Hurwitz class numbers coming from two different frameworks: one introduced by Pei and Wang, arising from the generalized Cohen–Eisenstein series, and another by Li, Skoruppa, and Zhou, arising from Eichler orders of quaternion algebras. As applications, we obtain new basis for Eisenstein space $E_{3/2}^{+}(4N)$, a generalization of recent results of Beckwith and Mono, and a generalization of Gauss' formula.

Event contact: Gene Kopp


Posted November 4, 2026
Last modified November 6, 2026

Colloquium Questions or comments?

3:30 pm

Tatiana Brailovskaya, Duke University
Spectrum of Brownian Motions on the General Linear Group

Classical Brownian motion on the real line was first introduced in its rigorous form by Norbert Weiner in 1920s, formalizing the «wiggling» of tiny particles in a fluid or gaseous medium that by then had been studied by scientists for at least a century. Nowadays, understanding Brownian motions on more sophisticated domains, such as Lie groups, is a rich area of study. In this talk, I will focus on a family of multiplicative Brownian motions $B^{N(t)}$ on the General Linear Group of degree $N$, i.e. at each time $t$, $B^{N(t)}$ is an $N \times N$ random matrix. In 1997, Philippe Biane conjectured that as $N \to \infty$ the empirical spectral measure of $B^{N(t)}$ converges to the Brown measure of a free multiplicative Brownian motion at time $t$, which is a diffusion on a certain infinite-dimensional space. With Nick Cook, Todd Kemp and Félix Parraud we confirm this conjecture.


Posted September 30, 2026
Last modified November 2, 2026

Computational Mathematics Seminar

3:30 pm – 4:20 pm LDMC, Room 1034

Gonzalo Benavides, University of Maryland
A priori error analysis for the Shliomis ferrofluid model without magnetic regularization

We develop and analyze a family of conforming, energy-stable spatial semidiscretizations of the Shliomis ferrofluid model in two and three space dimensions. Unlike many existing numerical analyses, we treat the system without introducing magnetic diffusion. The limited spatial control supplied by the energy law complicates the treatment of magnetic nonlinearities in the error analysis. Our formulation retains the rotational coupling and nonlinear magnetic relaxation and incorporates the magnetic normal-flux condition naturally, overcoming the dimensional restriction and boundary-enforcement difficulties of the two-potential approach of Benavides, Nochetto and Shakipov (2026). The error analysis combines consistent stabilization of the Maxwell constraint with a cancellation arising from exact incompressibility and the pointwise symmetry of the Hessian of the magnetic potential. We prove global solvability of the semidiscrete scheme and establish a priori error estimates for sufficiently regular exact solutions under explicit approximation and projection-stability assumptions. We also construct an averaged $\mathrm{H}^2$-conforming projector, following Girault and Scott (2002), that is defined on $\mathrm{L}^1$, and establish its Sobolev approximation and stability properties. These properties are needed for the error analysis and are of independent interest.

Event contact: Shawn Walker