Test
- Series
- ACO Alumni Lecture
- Time
- Thursday, January 15, 2026 - 08:00 for
- Location
- Speaker
Computational methods have long inspired conjecture and counterexamples in mathematics, and in recent years they appear more frequently in proofs of interesting mathematical theorems like the four color problem, Kepler's optimal sphere packing problem, and the proof of the Feigenbaum conjectures in nonlinear dynamics. In this talk I'll discuss recent work of R. Calleja, C. Garcia, O. Henot, J.P. Lessard and myself on choreographic solutions of the gravitational N-body problem. After reviewing some history and motivation, I'll explain the role of the digital computer in the (quite constructive) proofs of the theorems.
http://gatech.zoom.us/my/rkuske7?pwd=aHlLUFBFc2JndXlTelV1d3NlOEJBdz09
Deep learning has been widely applied and brought breakthroughs in speech recognition, computer vision, natural language processing, and many other domains. The involved deep neural network architectures and computational issues have been well studied in machine learning. But there is much less theoretical understanding about the modelling, approximation or generalization abilities of deep learning models with network architectures. An important family of structured deep neural networks is deep convolutional neural networks (CNNs) induced by convolutions. The convolutional architecture gives essential differences between deep CNNs and fully-connected neural networks, and the classical approximation theory for fully-connected networks developed around 30 years ago does not apply. This talk describes approximation and generalization analysis of deep CNNs and related structured deep neural networks.
Using the theory of total linear stability for Dynkin quivers and an interplay between the Bruhat order and the noncrossing partition lattice, we define a family of triangulations of the permutohedron indexed by Coxeter elements. Each triangulation is constructed to give an explicit homotopy between two complexes (the Salvetti complex and the Bessis--Brady--Watt complex) associated to two different presentations of the corresponding braid group (the standard Artin presentation and Bessis's dual presentation). Our triangulations have several notable combinatorial properties. In addition, they refine similar Bruhat interval polytope decompositions of Knutson, Sanchez, and Sherman-Bennett. This is based on joint work with Melissa Sherman-Bennett and Nathan Williams.
The incipient infinite cluster was first proposed by physicists in the 1970s as a canonical example of a two-dimensional medium on which random walk is subdiffusive. It is the measure obtained in critical percolation by conditioning on the existence of an infinite cluster, which is a probability zero event. Kesten presented the first rigorous two-dimensional construction of this object as a weak limit of the one-arm event. In high dimensions, van der Hofstad and Jarai constructed the IIC as a weak limit of the two-point connection using the lace expansion. Our work presents a new high-dimensional construction which is "robust", establishing that the weak limit is independent of the choice of conditioning. The main tools used are Kesten's original two-dimensional construction combined with Kozma and Nachmias' regularity method. Our robustness allows for several applications, such as the explicit computation of the limiting distribution of the chemical distance, which forms the content of our upcoming project. This is joint work with Shirshendu Chatterjee, Jack Hanson, and Philippe Sosoe. The preprint can be found at http://arxiv.org/abs/2502.10882.
Let $f,g$ be $C^2$ area-preserving Anosov diffeomorphisms on $\mathbb{T}^2$ which are topologically conjugated by a homeomorphism $h$. It was proved by de la Llave in 1992 that the conjugacy $h$ is automatically $C^{1+}$ if and only if the Jacobian periodic data of $f$ and $g$ are matched by $h$ for all periodic orbits. We prove that if the Jacobian periodic data of $f$ and $g$ are matched by $h$ for all points of some large period $N\in\mathbb{N}$, then $f$ and $g$ are ``approximately smoothly conjugate." That is, there exists a a $C^{1+\alpha}$ diffeomorphism $\overline{h}_N$ that is exponentially close to $h$ in the $C^0$ norm, and such that $f$ and $f_N:=\overline{h}_N^{-1}\circ g\circ \overline{h}_N$ is exponentially close to $f$ in the $C^1$ norm.
Zoom link -
http://gatech.zoom.us/j/5506889191?pwd=jIjsRmRrKjUWYANogxZ2Jp1SYdaejU.1
Meeting ID: 550 688 9191
Passcode: 604975
How densely can one pack spheres in $d$-dimensional space? It is not too hard to show a lower bound of $2^{-d}$. (The only known upper bounds are exponentially larger.) Various proofs of lower bounds of the form $cd2^{-d}$ have been given; recently, Campos, Jenssen, Michelen, and Sahasrabudhe gave the first asymptotic improvement on such bounds in 75 years. I will discuss an extension of this improvement to packing other shapes in high dimensions, along with some connections to log-concave probability.
Mean-field games (MFG) theory is a mathematical framework for studying large systems of agents who play differential games. In the PDE form, MFG reduces to a Hamilton-Jacobi equation coupled with a continuity or Kolmogorov-Fokker-Planck equation. Theoretical analysis and computational methods for these systems are challenging due to the absence of strong regularizing mechanisms and coupling between two nonlinear PDE.
One approach that proved successful from both theoretical and computational perspectives is the variational approach, which interprets the PDE system as KKT conditions for suitable convex energy. MFG systems that admit such representations are called potential systems and are closely related to the dynamic formulation of the optimal transportation problem due to Benamou-Brenier. Unfortunately, not all MFG systems are potential systems, limiting the scope of their applications.
I will present a new approach to tackle non-potential systems by providing a suitable interpretation of the Benamou-Brenier approach in terms of monotone inclusions. In particular, I will present advances on the discrete level and numerical analysis and discuss prospects for the PDE analysis.
Ryser (1951) provided the conditions under which any $r\times s$ Latin rectangle can be extended to an $n\times n$ Latin square. In this talk, we provide various generalizations of this result in higher dimensions. We also proof an analogue of Ryser’s theorem for symmetric latin cubes.
TBD