I will give an overview of recent joint work with Jinmin Wang, Shmuel Weinberger, and Zhizhang Xie on the resolutions of several open questions of Gromov on positive scalar...
Read more
A long-standing problem in random graph theory has been to determine asymptotically the length of a longest induced path in sparse random graphs. Independent work of {\L}uczak and Suen from...
Read more
Quasiparticle excitations in 3 + 1 dimensions can be either bosons or fermions. In this work, we introduce the notion of fermionic loop excitations in 3 + 1 dimensional topological...
Read more
will speak on: The Noether Theorems in Geometry: Then and Now The 1918 Noether theorems were a product of the general search for energy and momentum conservation in Einstein’s newly...
Read more
The dynamical degree of an invertible self-map of projective space is an asymptotic measure of the algebraic complexity of the iterates of the map. This numerical invariant controls many aspects...
Read more
Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”....
Read more
Transformer models yield impressive results on many NLP and sequence modeling tasks. Remarkably, Transformers can handle long sequences which allows them to produce long coherent outputs: full paragraphs produced by...
Read more
I will describe some of my recent work on defects in supersymmetric field theories. The first part of my talk is focused on line defects in certain large classes of...
Read more
I will introduce a new brane engineering for 2d minimally supersymmetric, i.e. N=(0,1), gauge theories. Starting with 2d N=(0,2) gauge theories on D1-branes probing Calabi-Yau 4-folds, a brand new orientifold...
Read more
Let M_n be drawn uniformly from all n by n symmetric matrices with entries in {-1,1}. In this talk I’ll consider the following basic question: what is the probability that...
Read more