Seminars and Colloquia by Series

Hilbert 10 via additive combinatorics

Series
Athens-Atlanta Number Theory Seminar
Time
Tuesday, April 1, 2025 - 16:00 for 1 hour (actually 50 minutes)
Location
314 Skiles
Speaker
Carlo Pagano Concordia University

 

In 1970 Matiyasevich, building on earlier work of Davis--Putnam--Robinson, proved that every enumerable subset of Z is Diophantine, thus showing that Hilbert's 10th problem is undecidable for Z. The problem of extending this result to the ring of integers of number fields (and more generally to finitely generated infinite rings) has attracted significant attention and, thanks to the efforts of many mathematicians, the task has been reduced to the problem of constructing, for certain quadratic extensions of number fields L/K, an elliptic curve E/K with rk(E(L))=rk(E(K))>0

In this talk I will explain joint work with Peter Koymans, where we use Green--Tao to construct the desired elliptic curves, settling Hilbert 10 for every finitely generated infinite ring.

Recovery of Schrödinger nonlinearities from the scattering map

Series
PDE Seminar
Time
Tuesday, April 1, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jason MurphyUniversity of Oregon

We will discuss time-dependent, nonlinear “inverse scattering” in the setting of nonlinear Schrödinger equations.  In particular, we will show that it is possible to recover an unknown nonlinearity from the small-data scattering behavior of solutions.  Time permitting, we will also discuss stability estimates for reconstruction, as well as recovery from modified scattering behavior.  This talk will include some joint work with R. Killip and M. Visan, as well as with G. Chen.

Accelerated materials innovation using AI/ML and Digital Twins

Series
GT-MAP Seminar
Time
Tuesday, April 1, 2025 - 10:00 for 2 hours
Location
Skiles 006
Speaker
Prof. Surya R. KalidindiGeorgia Tech ME, CSE & MSE

Please Note: In person

This presentation will expound the challenges involved in the generation of digital twins (DT) as valuable tools for supporting innovation and providing informed decision support for the optimization of properties and/or performance of advanced material systems. This presentation will describe the foundational AI/ML (artificial intelligence/machine learning) concepts and frameworks needed to formulate and continuously update the DT of a selected material system. The central challenge comes from the need to establish reliable models for predicting the effective (macroscale) functional response of the heterogeneous material system, which is expected to exhibit highly complex, stochastic, nonlinear behavior. This task demands a rigorous statistical treatment (i.e., uncertainty reduction, quantification and propagation through a network of human-interpretable models) and fusion of insights extracted from inherently incomplete (i.e., limited available information), uncertain, and disparate (due to diverse sources of data gathered at different times and fidelities, such as physical experiments, numerical simulations, and domain expertise) data used in calibrating the multiscale material model. This presentation will illustrate with examples how a suitably designed Bayesian framework combined with emergent AI/ML toolsets can uniquely address this challenge.

TBD

Series
Geometry Topology Seminar
Time
Monday, March 31, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Ryan DickmannVanderbilt

TBD

Latent neural dynamics for fast data assimilation with sparse observations

Series
Applied and Computational Mathematics Seminar
Time
Monday, March 31, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/94954654170
Speaker
Peng ChenGeorgia Tech CSE

Data assimilation techniques are crucial for correcting trajectories when modeling complex dynamical systems. The Latent Ensemble Score Filter (Latent-EnSF), our recently developed data assimilation method, has shown great promise in high-dimensional and nonlinear data assimilation problems with sparse observations. However, this method faces the challenge of high computational cost due to the expensive forward simulation. In this talk, we present Latent Dynamics EnSF (LD-EnSF), a novel methodology that evolves the neural dynamics in a low-dimensional latent space and significantly accelerates the data assimilation process.

 

To achieve this, we introduce a novel variant of Latent Dynamics Networks (LDNets) to effectively capture the system's dynamics within a low-dimensional latent space. Additionally, we propose a new method for encoding sparse observations into the latent space using recurrent neural networks. We demonstrate the robustness, accuracy, and efficiency of the proposed methods and their limitations for complex dynamical systems with highly sparse (in both space and time) and noisy observations, including shallow water wave propagation for tsunami modeling, FourCastNet in numerical weather prediction, and Kolmogorov flow that exhibits chaotic and turbulent phenomena.

On two Notions of Flag Positivity

Series
Algebra Seminar
Time
Monday, March 31, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jonathan BoretskyCentre de Recherches Mathématiques, Montreal

Please Note: There will be a preseminar from 10:55 to 11:15 in the morning in Skiles 005.

The totally positive flag variety of rank r, defined by Lusztig, can be described as the set of rank r flags of real linear subspaces which can be represented by a matrix whose minors are all positive. For flag varieties of consecutive rank, this equals the subset of the flag variety with positive Plücker coordinates, yielding a straightforward condition to determine whether a flag is totally positive. This generalizes the well-established fact, proven independently by many authors including Rietsch, Talaska and Williams, Lam, and Lusztig, that the totally positive Grassmannian equals the subset of the Grassmannian with positive Plücker coordinates. We discuss the "tropicalization" of this result, relating the nonnegative tropical flag variety to the nonnegative Dressian, a space parameterizing the regular subdivisions of flag positroid polytopes into flag positroid polytopes. Many results can be generalized to flag varieties of types B and C. This talk is primarily based on joint work with Chris Eur and Lauren Williams and joint work with Grant Barkley, Chris Eur and Johnny Gao.

Universality for graphs of bounded degeneracy

Series
Combinatorics Seminar
Time
Friday, March 28, 2025 - 15:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Anita LiebenauUNSW Sydney

What is the smallest number of edges that a graph can have if it contains all D-degenerate graphs on n vertices as subgraphs? A counting argument shows that this number is at least of order n21/D, assuming n is large enough. We show that this is tight up to a polylogarithmic factor.

Joint work with Peter Allen and Julia Böttcher.

Randomized Iterative Sketch-and-Project Methods as Efficient Large-Scale Linear Solvers

Series
Stochastics Seminar
Time
Thursday, March 27, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Elizaveta RebrovaPrinceton

Randomized Kaczmarz methods — popular special case of the sketch-and-project optimization framework — solve linear systems through iterative projections onto randomly selected equations, resulting in exponential expected convergence via cheap, local updates. While known to be effective in highly overdetermined problems or under the restricted data access, identifying generic scenarios where these methods are advantageous compared to classical Krylov subspace solvers (e.g., Conjugate Gradient, LSQR, GMRES) remained open. In this talk, I will present our recent results demonstrating that properly designed randomized Kaczmarz (sketch-and-project) methods can outperform Krylov methods for both square and rectangular systems complexity-wise. In addition, they are particularly advantageous for approximately low-rank systems common in machine learning (e.g., kernel matrices, signal-plus-noise models) as they quickly capture the large outlying singular values of the linear system. Our approach combines novel spectral analysis of randomly sketched projection matrices with classical numerical analysis techniques, such as including momentum, adaptive regularization, and memoization.

Local-to-global in thin orbits

Series
School of Mathematics Colloquium
Time
Thursday, March 27, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Kate StangeUniversity of Colorado, Boulder

Primitive integral Apollonian circle packings are fractal arrangements of tangent circles with integer curvatures.  The curvatures form an orbit of a 'thin group,' a subgroup of an algebraic group having infinite index in its Zariski closure.  The curvatures that appear must fall into a restricted class of residues modulo 24. The twenty-year-old local-global conjecture states that every sufficiently large integer in one of these residue classes will appear as a curvature in the packing. We prove that this conjecture is false for many packings, by proving that certain quadratic and quartic families are missed. The new obstructions are a property of the thin Apollonian group (and not its Zariski closure), and are a result of quadratic and quartic reciprocity, reminiscent of a Brauer-Manin obstruction. Based on computational evidence, we formulate a new conjecture.  This is joint work with Summer Haag, Clyde Kertzer, and James Rickards.  Time permitting, I will discuss some new results, joint with Rickards, that extend these phenomena to certain settings in the study of continued fractions.

Statistical problems for Smoluchowski processes

Series
Stochastics Seminar
Time
Tuesday, March 25, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Alexander GoldenshlugerUniversity of Haifa

Suppose that particles are randomly distributed in Rd, and they are subject to identical stochastic motion independently of each other. The Smoluchowski process describes fluctuations of the number of particles in an observation region over time. The goal is to infer on particle displacement process from such count data. We discuss probabilistic properties of the Smoluchowski processes and consider related statistical problems for two different models of the particle displacement process: the undeviated uniform motion (when a particle moves with random constant velocity along a straight line) and the Brownian motion displacement. In these settings we develop estimators with provable accuracy guarantees.

Pages