Seminars and Colloquia by Series

Numbers with close factorizations

Series
Number Theory
Time
Wednesday, October 1, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tsz Ho ChanKennesaw State University

In this talk, we consider numbers with multiple close factorizations like $99990000 = 9999 \cdot 10000 = 9090 \cdot 11000$ and $3950100 = 1881 \cdot 2100 = 1890 \cdot 2090 = 1900 \cdot 2079$. We discuss optimal bounds on how close these factors can be relative to the size of the original numbers. It is related to the study of close lattice points on smooth curves.

ASYMPTOTIC STABILITY OF MULTI-SOLITONS FOR 1D SUPERCRITICAL NLS

Series
PDE Seminar
Time
Tuesday, September 30, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 154
Speaker
Abdon MoutinhoGeorgia Tech

Motivated by the Soliton Resolution Conjecture, the study of dynamics of multi-solitons has been crucial to understand the  long-time behavior of solutions for dispersive PDEs.

In this talk, we consider one-dimensional L2 supercritical nonlinear Schrödinger equation.

It is well-known that the solitons for this model are unstable, but conditional asymptotic stability for a single soliton was obtained in the pioneering work of Krieger and Schlag. In this talk, using the linear and scattering theory developed in our previous work, we show the conditional strong asymptotic stability for any multi-solitons with large separation in the speed. More precisely,  this solution of the supercritical NLS will converge asymptotically in the H1 norm to a finite of multi-solitons moving with constant speeds plus a radiation (Scattering of the remainder).  Finally, at the end of the talk, we discuss our ongoing research related to this topic.  This is a joint work with Gong Chen.

High-Order Spectral Difference Method for Ducted Wind Turbine Aerodynamics and Solar Magnetohydrodynamics

Series
Applied and Computational Mathematics Seminar
Time
Monday, September 29, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Chunlei LiangClarkson University

This talk highlights two recent advances in applying the high-order spectral difference (SD) method for computational fluid dynamics on unstructured meshes. The first is a novel curved sliding-mesh technique for the SD method, enabling accurate simulations of rotary-wing aerodynamics. Recent applications include large eddy simulations of marine propellers and ducted wind turbines. The second is the development of a massively parallel code, CHORUS++, designed for Nvidia GPUs to study magnetohydrodynamics in the solar interior. From a computational mathematics standpoint, Dr. Liang also introduced the spectral difference with divergence cleaning (SDDC) algorithm, which addresses the solenoidal constraint of magnetic fields, particularly in the presence of physical boundaries on 3D unstructured grids.

Algebraic Topology and Aggregations of Quadratic Inequalities

Series
Algebra Seminar
Time
Monday, September 29, 2025 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Alex DunbarGeorgia Tech

We study the problem of computing the convex hull of a set $S \subseteq \mathbb{R}^n$ defined by three quadratic inequalities. A simple way to generate inequalities valid on $S$ is to take nonnegative linear combinations, called aggregations, of the defining inequalities. We study the set defined by aggregations using topological duality results for quadratic inequalities. In the case of three quadratic inequalities, this relates aggregations to an algebraic curve. This viewpoint allows us to find new cases for which the convex hull of $S$ can be recovered by aggregations. Joint work with Greg Blekherman.

Regularity method in hypergraphs with no 4-cycles in their links

Series
Combinatorics Seminar
Time
Friday, September 26, 2025 - 15:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ayush BasuEmory University

The regularity method for graphs has been well studied for dense graphs, i.e., graphs on $n$ vertices with $\Omega(n^2)$ edges. However, applying it to sparse graphs, i.e., those with $o(n^2)$ edges seems to be a harder problem. In the mid 2010s, the regularity method was extended to dense subgraphs of random graphs thus resolving the KŁR conjecture. Later, in another direction, Conlon, Fox, Sudakov and Zhao proved a removal lemma for $C_5$ in graphs that do not contain any $C_4$ (such graphs on $n$ vertices can contain at most $n^{3/2}$ edges). In this talk, we will consider a similar problem for sparse $3$-uniform hypergraphs. In particular, we consider an application of the regularity method to $3$-uniform hypergraphs whose vertices do not contain $C_4$ in their links and satisfy an additional boundedness condition. This is joint work with Vojtěch Rödl and Mathias Schacht.

Filamentations of vortex caps for the Euler equation

Series
Math Physics Seminar
Time
Friday, September 26, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Gian Marco MarinGeorgia Tech

We rigorously prove the filamentation phenomenon for a class of weak solutions to the Euler equations known as vortex caps. Vortex caps are characteristic functions representing time-evolving sets of Lagrangian type, with energy preserved at all times. The filamentation of vortex caps is characterized by L^1 -stability alongside unbounded growth of the perimeter of their interfaces. We recall the existence and stability results for vortex caps on the sphere, based on Yudovich theory. Using L^1 -stability, we derive a lower bound for the growth of the perimeter of vortex caps over time.

A New Universality Class for the Formation of Giant Components

Series
Stochastics Seminar
Time
Thursday, September 25, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Souvik DharaGeorgia Tech

The emergence of large connected structures in networks has been a central topic in random graph theory since its inception, forming a foundation for understanding fundamental processes such as the spread of influence or epidemics, and the robustness of networked systems. The field witnessed significant growth from the early 2000s, fueled by a surge in experimental work from statistical physics that introduced fascinating concepts such as universality. Broadly speaking, universality suggests that the formation of a giant component in random graphs often depends primarily on macroscopic statistical properties like the degree distribution. In the theoretical literature, two universality classes have emerged, both closely related to Aldous’ seminal work on critical random graphs and the theory of multiplicative coalescents. In this talk, I will present a third universality class that emerges in the setting of percolation on random graphs with infinite-variance degree distributions. The new universality class exhibits fundamentally different behavior compared to multiplicative coalescents and reveals surprising phenomena concerning the width of the critical window—phenomena that were unforeseen in the substantial physics literature on this topic. Based on joint work with Shankar Bhamidi and Remco van der Hofstad.

Novel metrics of entanglement of open curves in 3-space and their applications to proteins

Series
School of Mathematics Colloquium
Time
Thursday, September 25, 2025 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Eleni PanagiotouArizona State University

Filamentous materials may exhibit structure-dependent material properties and function that depend on their entanglement. Even though intuitively entanglement is often understood in terms of knotting or linking, many of the filamentous systems in the natural world are not mathematical knots or links. In this talk, we will introduce a novel and general framework in knot theory that can characterize the complexity of open curves in 3-space. This leads to new metrics of entanglement of open curves in 3-space that generalize classical topological invariants, like for example, the Jones polynomial and Vassiliev invariants. For open curves, these are continuous functions of the curve coordinates and converge to topological invariants of classical knots and links when the endpoints of the curves tend to coincide. These methods provide an innovative approach to advance important questions in knot theory. As an example, we will see how the theory of linkoids enables the first, to our knowledge, parallel algorithm for computing the Jones polynomial.

Importantly, this approach opens exciting applications to systems that can be modeled as open curves in 3-space, such as polymers and proteins, for which new quantitative relationships between their structure and material properties become evident. As an example, we apply our methods to proteins to understand the interplay between their structures and functions. By analyzing almost all protein structures in the Protein Data Bank, we derive for the first time a quantitative representation of the topology/geometry of the Topological Landscape of proteins. We show that 3 topological and geometrical parameters alone can predict the biological classifications of proteins with high accuracy. Moreover, preliminary results show that our proposed topological metrics based on static protein structures alone correlate with protein dynamics and protein function. The methods and results represent a new framework for advancing knot theory, as well as its applications to filamentous materials, which can be validated by experimental data and integrated into machine-learning algorithms.

Pontryagin’s Maximum Principle for Smooth Manifolds

Series
Geometry Topology Student Seminar
Time
Wednesday, September 24, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jaden WangGeorgia Tech

Please Note: Pontryagin’s Maximum Principle (PMP) is a landmark result in optimal control theory that continues to enjoy abundant applications in engineering and sciences. It was originally proven for the Euclidean case to find optimal terminal speed of a rocket during the Cold War. Due to its Hamiltonian nature, it is not much harder to generalize to the smooth manifold case. In this introductory talk, I will first introduce the necessary symplectic/Hamiltonian formalism and then give a sketch of the proof. The goal is to highlight the elegant topological insights that reduce an infinite-dimensional optimization problem to a pointwise optimization of the Hamiltonian.

Abstract TBA

Hypergraph Turán Problems

Series
Graph Theory Seminar
Time
Tuesday, September 23, 2025 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Bernard LidickýIowa State University

Hypergraph Turán Problems became more approachable due to flag algebras. In this talk we will first focus on tight cycles without an edge. A tight $k$-cycle minus an edge $C_k^-$ is the 3-graph on the vertex set $[k]$, where any three consecutive vertices in the string $123...k1$ form an edge. We show that for every $k \geq 5$, k not divisible by $3$, the extremal density is $1/4$. Moreover, we determine the extremal graph up to $O(n)$ edge edits. The proof is based on flag algebra calculations.

Then we describe new developments in solving large semidefinite programs that allows for improving several other bounds on Turán densities.

This talk is based on joint work with Connor Mattes, Florian Pfender and Jan Volec.

Pages