The classical result on the uniqueness of black holes in GR, due to Hawking, which asserts that regular, stationary solutions of the Einstein vacuum equations must be isometric to an admissible black hole Kerr solution, has at its core a a highly unrealistic analyticity assumption for the metric. The goal of the talk is to survey recent results, obtained in collaboration with Alexakis and Ionescu, on the general rigidity problem, without analyticity.
School of Mathematics
It is becoming more and more clear that many of the most exciting structures of our world can be described as large networks. The internet is perhaps the foremost example, modeled by different networks (the physical internet, a network of devices; the world wide web, a network of webpages and hyperlinks). Various social networks, several of them created by the internet, are studied by sociologist, historians, epidemiologists, and economists. Huge networks arise in biology (from ecological networks to the brain), physics, and engineering.
For 2D Euler equation, we prove a double exponential lower bound on the vorticity gradient. We will also discus some further results on the singularity formation for other models.
In 1966 V. Arnold showed how solutions of the Euler equations of hydrodynamics can be viewed as geodesics in the group of volume-preserving diffeomorphisms. This provided a motivation to study the geometry of this group equipped with the \(L^2\) metric. I will describe some recent work on the structure of singularities of the associated exponential map and related results
It has been conjectured in numerous physics papers that in ordinary first-passage percolation on integer lattices, the fluctuation exponent \chi and the wandering exponent \xi are related through the universal relation \chi=2\xi -1, irrespective of the dimension. This is sometimes called the KPZ relation between the two exponents. I will give a rigorous proof of this conjecture assuming that the exponents exist in a certain sense.
A pseudo-random graph is a graph G resembling a typical random graph of the same edge density. Pseudo-random graphs are expected naturally to share many properties of their random counterparts. In particular, many of their enumerative properties should be similar to those of random graphs.