I will describe some more of the deformation theory necessary for the first talk. This leads to a number of natural questions and counterexamples. This talk requires a strong stomach, or a fanatical devotion to symmetric obstruction theories.
Extremal black holes are of interest as they are expected have simpler quantum descriptions than their non-extremal counterparts. Any extremal black hole solution admits a well defined notion of a near horizon geometry which solves the same field equations. I will describe recent progress on the general understanding of such near horizon geometries in four and higher dimensions. This will include the proof of near-horizon symmetry enhancement and the explicit classification of near-horizon geometries (in a variety of settings). I will also discuss how one can use such results to prove classification/uniqueness theorems for asymptotically flat extremal vacuum black holes in four and five dimensions.
Algebraic classification of the Weyl tensor is an important tool for solving the Einstein equation. I shall review the classification for spacetimes of dimension greater than four, and recent progress in using it to construct new exact solutions. The higher-dimensional generalization of the Goldberg-Sachs theorem will be discussed.
Fix a positive integer $k$, and consider the class of all graphs which do not have $k+1$ vertex-disjoint cycles. A classical result of Erdos and P\'{o}sa says that each such graph $G$ contains a blocker of size at most $f(k)$. Here a {\em blocker} is a set $B$ of vertices such that $G-B$ has no cycles.
We give a minor extension of this result, and deduce that almost all such labelled graphs on vertex set $1,\ldots,n$ have a blocker of size $k$. This yields an asymptotic counting formula for such graphs; and allows us to deduce further properties of a graph $R_n$ taken uniformly at random from the class: we see for example that the probability that $R_n$ is connected tends to a specified limit as $n \to \infty$.
There are corresponding results when we consider unlabelled graphs with few disjoint cycles. We consider also variants of the problem involving for example disjoint long cycles.
This is joint work with Valentas Kurauskas and Mihyun Kang.
Gupta et al. introduced a very general multi-commodity flow problem in which the cost of a given flow solution on a graph $G=(V,E)$ is calculated by first computing the link loads via a load-function l, that describes the load of a link as a function of the flow traversing the link, and then aggregating the individual link loads into a single number via an aggregation function.
We show the existence of an oblivious routing scheme with competitive ratio $O(\log n)$ and a lower bound of $\Omega(\log n/\logl\og n)$ for this model when the aggregation function agg is an $L_p$-norm.
Our results can also be viewed as a generalization of the work on approximating metrics by a distribution over dominating tree metrics and the work on minimum congestion oblivious. We provide a convex combination of trees such that routing according to the tree distribution approximately minimizes the $L_p$-norm of the link loads. The embedding techniques of Bartal and Fakcharoenphol et al. [FRT03] can be viewed as solving this problem in the $L_1$-norm while the result on congestion minmizing oblivious routing solves it for $L_\infty$. We give a single proof that shows the existence of a good tree-based oblivious routing for any $L_p$-norm.