Calendar

Posted February 28, 2026

Probability Seminar Questions or comments?

Leo Tyrpak, University of Oxford
Fluctuations of spatial population models with non-local interactions

We analyse a class of spatial population models where the branching rate of particles depends non-locally on the whole empirical measure of particles. Scaling limits of this model have previously been shown to include the non-local Fisher-KPP equation and the porous medium equation. In this talk we will discuss the fluctuations of the process around these deterministic limits. We will show how an understanding of these can be applied to quantify the impact on geographical distance on genetic distance in the spirit of the classical Wright-Malecot formula.

Posted February 10, 2026

Mathematical Physics and Representation Theory Seminar

Milo Moses, Caltech
Four-colorings, recoverability, and topological quantum matter

In ongoing joint work with A. Kitaev, D. Ranard, I. Kim, we have been developing a formalism for exploring topologically ordered quantum states using recovery maps. In this talk, I will explain the potential applicability of these recovery maps to the study of 4-colorings of planar graphs. Conditioned on an unproven technical lemma (which perhaps someone in the audience can demonstrate!), I can show that bridgeless planar graphs quasi-isometric to the Euclidean plane obey a medley of properties reminiscent of topological quantum order.

Posted February 9, 2026

Informal Analysis Seminar Questions or comments?

Basit Abdulfatai, Louisiana State University
Dolapo Onifade, Louisiana State University
Introduction to deep adaptive sampling and physics informed neural networks

Posted January 19, 2026

Geometry and Topology Seminar Seminar website

Ettore Marmo, Università degli Studi di Milano-Bicocca
TBA

Posted January 15, 2026
Last modified February 27, 2026

Informal Geometry and Topology Seminar Questions or comments?

Benjamin Appiah, Louisiana State University
An example of color evaluation in graphene diagrams.

In this talk, I will explore the concept of decorated ribbon graphs, graphene diagrams, and virtual links. Then introduce a novel coloring technique called color evaluation. I will conclude by discussing an example of how this color evaluation is invariant in virtual link, knot, and graphene diagrams.

Posted February 26, 2026

LSU SIAM Student Chapter

Harbir Antil, George Mason University
Malena Espanol, Arizona State University
A Lunch with SCALA Speakers

A lunch and informal discussion providing an opportunity to ask questions before SCALA.

Posted September 3, 2025
Last modified January 14, 2026

Conference

Scientific Computing Around Louisiana (SCALA) 2026

http://www.cct.lsu.edu/SCALA2026

Posted February 26, 2026

Combinatorics Seminar Questions or comments?

Zi-Xia Song, University of Central Florida
Dominating Hadwiger's Conjecture

A dominating $K_t$ minor in a graph $G$ is a sequence $(T_1,\cdots,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1 \leq i < j \leq t$, every vertex in $T_j$ has a neighbor in $T_i$. Replacing "every vertex in $T_j$" by "some vertex in $T_j$" retrieves the standard definition of a $K_t$ minor. The strengthened notion was introduced in 2024 by Illingworth and Wood, who asked whether every graph with chromatic number $t$ contains a dominating $K_t$ minor. This is a substantial strengthening of the celebrated Hadwiger's Conjecture, which asserts that every graph with chromatic number $t$ contains a $K_t$ minor. Sergey Norin referred to this question as the "Dominating Hadwiger's Conjecture" and believes it is likely false. In this talk, we present our recent work on the Dominating Hadwiger's Conjecture and discuss the key ideas of our results. Joint work with Michael Scully and Thomas Tibbetts.