Seminars and Colloquia by Series

Reduced-order data assimilation models for computing probability distributions of complex multiscale systems

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 17, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/94954654170
Speaker
Di QiPurdue University

A new strategy is presented for the statistical forecasts of multiscale nonlinear systems involving non-Gaussian probability distributions. The capability of using reduced-order models to capture key statistical features is investigated. A closed stochastic-statistical modeling framework is proposed using a high-order statistical closure enabling accurate prediction of leading-order statistical moments and probability density functions in multiscale complex turbulent systems. A new efficient ensemble forecast algorithm is developed dealing with the nonlinear multiscale coupling mechanism as a characteristic feature in high-dimensional turbulent systems. To address challenges associated with closely coupled spatio-temporal scales in turbulent states and expensive large ensemble simulation for high-dimensional complex systems, we introduce efficient computational strategies using the random batch method. Effective nonlinear ensemble filters are developed based on the nonlinear coupling structures of the explicit stochastic and statistical equations, which satisfy an infinite-dimensional Kalman-Bucy filter with conditional Gaussian dynamics. It is demonstrated that crucial principal statistical quantities in the most important large scales can be captured efficiently with accuracy using the new reduced-order model in various dynamical regimes of the flow field with distinct statistical structures.

Arithmetic ranks of nullcones

Series
Algebra Seminar
Time
Monday, November 17, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Uli WaltherPurdue University

Please Note: There will be a pre-seminar 10:55-11:25 in Skiles 005.

For the classical actions of the linear algebraic groups in characteristic zero (special linear, orthogonal, symplectic) we calculate the arithmetic rank of Hilbert's nullcone ideals via a general theorem on pure subrings. Then, in positive charactersitic, we discuss topological methods that lead to an inequality between arithmetic rank of the nullcone ideal and the dimension of the invariant ring, that can be used to replace the argument of the pure subring (which is false in positive characteristic). In the outline of his argument we spend most of the time over the complex numbers, for better comfort. This is a report on a paper with J Jeffries, V Pandey and A K Singh.

Local Permutation Removal;

Series
Combinatorics Seminar
Time
Friday, November 14, 2025 - 15:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ruilin ShiDuke University

The permutation removal lemma was first proved by Klimosová and Král’, and later reproved by Fox and Wei in the context of permutation property testing. In this talk, we study a local version of the permutation removal problem. We show that for any permutation σ not equal to 12, 21, 132, 231, 213, or 312, there exists ε(σ) > 0 such that for any sufficiently large integer N, there is a permutation π of length N that is ε-far from being σ-free with respect to the ρ∞ distance, yet contains only a single copy of σ. Here, the ρ∞ distance is defined as an L∞-variant of the Earth Mover’s Distance between two permutations. We will also discuss our result on the local induced graph removal problem. This is joint work with Fan Wei.

On quantitative chaos of rescaled states

Series
Math Physics Seminar
Time
Friday, November 14, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Zoom and streamed in Skiles 006
Speaker
Hagop TossounianUniversidad de Concepción

Please Note: In order to derive his equation, Boltzmann used the assumption that the probability density function f(t,x1,v1, x2,v2, ..., xN,vN), describing the positions and velocities of a gas of N identical particles at time t, stays close to a product g(t,x1,v1) g(t,x2,v2)...g(t,xN,vN). Here g is the common 1-particle distribution. Mark Kac introduced a probabilistic model for N particles, for which Boltzmann's assumption is valid as N goes to infinity in a specific sense, provided that it is valid at an initial time. Kac's requirement concerning the N particle density functions at some initial time is nowadays known as chaos (or molecular chaos), and Kac's result is known as propagation of chaos. The aim of this talk is to retake the question, first asked and studied in [CCLLV] : For which density functionals g can we produce a family of symmetric densities {fN} supported on the constant energy sphere {v1^2+v2^2+ ... + vN^2 = N} which are chaotic to g? Using rescaled states, we show [CT] that the class of admissible g, obtained in [CCLLV] using other methods, can be expanded. We also mention some new ideas in this direction. This talk is introductory. References: [CCLLV] Carlen, Eric A., et al. "Entropy and chaos in the Kac model." Kinetic and Related Models 3.1 (2010): 85-122. [CT] Cortez, Roberto, and Hagop Tossounian. "Chaos for rescaled measures on Kac’s sphere." Electronic Journal of Probability 28 (2023): 1-29.

Extreme singular values of sparse random rectangular matrices

Series
Stochastics Seminar
Time
Thursday, November 13, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Yizhe ZhuUniversity of Southern California

The bi-adjacency matrix of an Erdős–Rényi random bipartite graph with bounded aspect ratio is a rectangular random matrix with Bernoulli entries. Depending on the sparsity parameter $p$, its spectral behavior may either resemble that of a classical Wishart matrix or depart from this universal regime. In this talk, we study the extreme singular values at the critical density $np=c\log n$. We present the first quantitative characterization of the emergence of outlier singular values outside the Marčenko–Pastur law and determine their precise locations as functions of the largest and smallest degree vertices in the underlying random graph, which can be seen as an analogue of the Bai–Yin theorem in the sparse setting. These results uncover a clear mechanism by which combinatorial structures in sparse graphs generate spectral outliers. Joint work with Ioana Dumitriu, Haixiao Wang and Zhichao Wang.

100 years of Sperner's Lemma: proofs, generalizations, and applications

Series
School of Mathematics Colloquium
Time
Thursday, November 13, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Francis SuHarvey Mudd College

Sperner's lemma is a simple combinatorial result that is surprisingly powerful and useful---bringing together ideas in combinatorics, geometry, and topology while attracting interest from economists and game theorists. I'll explain why, show some old and new proofs, and present some recent generalizations with diverse applications.

Using convex surfaces to classify Legendrian cable links

Series
Geometry Topology Student Seminar
Time
Wednesday, November 12, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Tom RodewaldGeorgia Tech

Dalton, Etnyre, and Traynor classified Legendrian cable links when the companion knot is both uniformly thick and Legendrian simple, and Etnyre, Min, and Chakraborty classified all cable knots of uniformly thick knots. Using convex surfaces, we build on these results to classify cable links of knots in $(S^3, \xi_\text{std})$ that are uniformly thick but not Legendrian simple, and address new questions that arise from their nonsimplicity. This is joint work with Rima Chatterjee, John Etnyre, and Hyunki Min.

Separation rates for non-unique Navier-Stokes flows

Series
PDE Seminar
Time
Tuesday, November 11, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 154
Speaker
Zachary BradshawUniversity of Arkansas

 

Fluid models are used to make predictions about critical real-world systems arising in diverse fields including but not limited to meteorology, climate science, mechanical engineering, and geophysics. Simulations based on fluid models can, for example, be used to make predictions about the strength of a tornado or the stresses on an aircraft wing passing through turbulent air. The possibility that a mathematical model does not capture the full range of possible real-world scenarios is concerning if the predictions do not account for extreme events. It has been confirmed by computer assisted proof that the 3D Navier-Stokes equations possess non-unique solutions. The existence of such solutions can, in principle, pose a challenge to forecasters. This talk explores mathematical work aiming to quantify the rate at which non-unique solutions can separate.

Pages