Mon, 17 Jan 2022

15:30 - 16:30
Virtual

### The link surgery formula and plumbed 3-manifolds

Ian Zemke
(Princeton)
Abstract

Lattice homology is a combinatorial invariant of plumbed 3-manifolds due to Nemethi. The definition is a formalization of Ozsvath and Szabo's computation of the Heegaard Floer homology of plumbed 3-manifolds. Nemethi conjectured that lattice homology is isomorphic to Heegaard Floer homology. For a restricted class of plumbings, this isomorphism is known to hold, due to work of Ozsvath-Szabo, Nemethi, and Ozsvath-Stipsicz-Szabo. By using the Manolescu-Ozsvath link surgery formula for Heegaard Floer homology, we prove the conjectured isomorphism in general. In this talk, we will talk about aspects of the proof, and some related topics and extensions of the result.

Fri, 27 May 2022

15:00 - 16:00
L2

### The nonlinear stability of Kerr for small angular momentum

Sergiu Klainerman
(Princeton)
Abstract

I will report on my most recent results  with Jeremie Szeftel and Elena Giorgi which conclude the proof of the nonlinear, unconditional, stability of slowly rotating Kerr metrics. The main part of the proof, announced last year, was conditional on results concerning boundedness and decay estimates for nonlinear wave equations. I will review the old results and discuss how the conditional results can now be fully established.

Fri, 11 Jun 2021

14:00 - 15:00

### Geometric Methods for Machine Learning and Optimization

Melanie Weber
(Princeton)
Abstract

Many machine learning applications involve non-Euclidean data, such as graphs, strings or matrices. In such cases, exploiting Riemannian geometry can deliver algorithms that are computationally superior to standard(Euclidean) nonlinear programming approaches. This observation has resulted in an increasing interest in Riemannian methods in the optimization and machine learning community.

In the first part of the talk, we consider the task of learning a robust classifier in hyperbolic space. Such spaces have received a surge of interest for representing large-scale, hierarchical data, due to the fact that theyachieve better representation accuracy with fewer dimensions. We present the first theoretical guarantees for the (robust) large margin learning problem in hyperbolic space and discuss conditions under which hyperbolic methods are guaranteed to surpass the performance of their Euclidean counterparts. In the second part, we introduce Riemannian Frank-Wolfe (RFW) methods for constrained optimization on manifolds. Here, we discuss matrix-valued tasks for which such Riemannian methods are more efficient than classical Euclidean approaches. In particular, we consider applications of RFW to the computation of Riemannian centroids and Wasserstein barycenters, both of which are crucial subroutines in many machine learning methods.

Tue, 04 May 2021
16:00

### Gluon Scattering in AdS from CFT

Xinan Zhou
(Princeton)
Abstract

In this talk, I will discuss AdS super gluon scattering amplitudes in various spacetime dimensions. These amplitudes are dual to correlation functions in a variety of non-maximally supersymmetric CFTs, such as the 6d E-string theory, 5d Seiberg exceptional theories, etc. I will introduce a powerful method based on symmetries and consistency conditions, and show that it fixes all the infinitely many four-point amplitudes at tree level. I will also point out many interesting properties and structures of these amplitudes, which include the flat space limit, Parisi-Sourlas-like dimensional reduction, hidden conformal symmetry, and a color-kinematic duality in AdS. Along the way, I will also review some earlier progress and the relation with this work. I will conclude with a brief discussion of various open problems.

Tue, 16 Feb 2021
15:30
Virtual

### Some unusual extremal problems in convexity and combinatorics

Ramon van Handel
(Princeton)
Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Abstract

It is a basic fact of convexity that the volume of convex bodies is a polynomial, whose coefficients contain many familiar geometric parameters as special cases. A fundamental result of convex geometry, the Alexandrov-Fenchel inequality, states that these coefficients are log-concave. This proves to have striking connections with other areas of mathematics: for example, the appearance of log-concave sequences in many combinatorial problems may be understood as a consequence of the Alexandrov-Fenchel inequality and its algebraic analogues.

There is a long-standing problem surrounding the Alexandrov-Fenchel inequality that has remained open since the original works of Minkowski (1903) and Alexandrov (1937): in what cases is equality attained? In convexity, this question corresponds to the solution of certain unusual isoperimetric problems, whose extremal bodies turn out to be numerous and strikingly bizarre. In combinatorics, an answer to this question would provide nontrivial information on the type of log-concave sequences that can arise in combinatorial applications. In recent work with Y. Shenfeld, we succeeded to settle the equality cases completely in the setting of convex polytopes. I will aim to describe this result, and to illustrate its potential combinatorial implications through a question of Stanley on the combinatorics of partially ordered sets.

Tue, 26 Jan 2021
15:30
Virtual

### Random friends walking on random graphs

Noga Alon
(Princeton)
Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Abstract

Let $X$ and $Y$ be two $n$-vertex graphs. Identify the vertices of $Y$ with $n$ people, any two of whom are either friends or strangers (according to the edges and non-edges in $Y$), and imagine that these people are standing one at each vertex of $X$. At each point in time, two friends standing at adjacent vertices of $X$ may swap places, but two strangers may not. The friends-and-strangers graph $FS(X,Y)$ has as its vertex set the collection of all configurations of people standing on the vertices of $X$, where two configurations are adjacent when they are related via a single friendly swap. This provides a common generalization for the famous 15-puzzle, transposition Cayley graphs of symmetric groups, and early work of Wilson and of Stanley.
I will describe several recent results and open problems addressing the extremal and typical aspects of the notion, focusing on the result that the threshold probability for connectedness of $FS(X,Y)$ for two independent binomial random graphs $X$ and $Y$ in $G(n,p)$ is $p=p(n)=n-1/2+o(1)$.
Joint work with Colin Defant and Noah Kravitz.

Mon, 18 Jan 2021
14:00
Virtual

### Ensemble averaging torus orbifolds

Nathan Benjamin
(Princeton)
Abstract

We generalize the recent holographic correspondence between an ensemble average of free bosons in two dimensions, and a Chern-Simons-like theory of gravity in three dimensions, by Afkhami-Jeddi et al and Maloney and Witten. We find that the correspondence also works for toroidal orbifolds, but we run into difficulties generalizing to K3 and Calabi-Yau sigma models. For the case of toroidal orbifolds, we extend the holographic correspondence to averages of correlation functions of twist operators by using properties of rational tangles in three-dimensional balls and their covering spaces. Based on work to appear with C. Keller, H. Ooguri, and I. Zadeh.

Thu, 22 Oct 2020

16:00 - 17:00
Virtual

### Thin Film Flows on a Substrate of Finite Width: A Novel Similarity Solution

Howard Stone
(Princeton)
Further Information

We return this term to our usual flagship seminars given by notable scientists on topics that are relevant to Industrial and Applied Mathematics.

Abstract

There are many examples of thin-film flows in fluid dynamics, and in many cases similarity solutions are possible. In the typical, well-known case the thin-film shape is described by a nonlinear partial differential equation in two independent variables (say x and t), which upon recognition of a similarity variable, reduces the problem to a nonlinear ODE. In this talk I describe work we have done on 1) Marangoni-driven spreading on pre-wetted films, where the thickness of the pre-wetted film affects the dynamics, and 2) the drainage of a film on a vertical substrate of finite width. In the latter case we find experimentally a structure to the film shape near the edge, which is a function of time and two space variables. Analysis of the corresponding thin-film equation shows that there is a similarity solution, collapsing three independent variables to one similarity variable, so that the PDE becomes an ODE. The solution is in excellent agreement with the experimental measurements.

Thu, 18 Jun 2020

16:00 - 17:00

### Deep Neural Networks for Optimal Execution

LAURA LEAL
(Princeton)
Abstract

Abstract: We use a deep neural network to generate controllers for optimal trading on high frequency data. For the first time, a neural network learns the mapping between the preferences of the trader, i.e. risk aversion parameters, and the optimal controls. An important challenge in learning this mapping is that in intraday trading, trader's actions influence price dynamics in closed loop via the market impact. The exploration--exploitation tradeoff generated by the efficient execution is addressed by tuning the trader's preferences to ensure long enough trajectories are produced during the learning phase. The issue of scarcity of financial data is solved by transfer learning: the neural network is first trained on trajectories generated thanks to a Monte-Carlo scheme, leading to a good initialization before training on historical trajectories. Moreover, to answer to genuine requests of financial regulators on the explainability of machine learning generated controls, we project the obtained blackbox controls'' on the space usually spanned by the closed-form solution of the stylized optimal trading problem, leading to a transparent structure. For more realistic loss functions that have no closed-form solution, we show that the average distance between the generated controls and their explainable version remains small. This opens the door to the acceptance of ML-generated controls by financial regulators.

Tue, 09 Jun 2020
16:30
Virtual

### Replica Symmetry Breaking for Random Regular NAESAT

Allan Sly
(Princeton)
Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Abstract

Ideas from physics have predicted a number of important properties of random constraint satisfaction problems such as the satisfiability threshold and the free energy (the exponential growth rate of the number of solutions). Another prediction is the condensation regime where most of the solutions are contained in a small number of clusters and the overlap of two random solutions is concentrated on two points. We establish this phenomena in the random regular NAESAT model. Joint work with Danny Nam and Youngtak Sohn.

Subscribe to Princeton