A key challenge in Riemannian geometry is to find ``best" metrics on compact manifolds. To construct such metrics explicitly one is interested to know if approximation sequences contain subsequences that converge in some sense to a limit manifold.

In this talk we will present convergence results of sequences of closed Riemannian
4-manifolds with almost vanishing L2-norm of a curvature tensor and a non-collapsing bound on the volume of small balls.  For instance we consider a sequence of closed Riemannian 4-manifolds,
whose L2-norm of the Riemannian curvature tensor is uniformly bounded from
above, and whose L2-norm of the traceless Ricci-tensor tends to zero.  Here,
under the assumption of a uniform non-collapsing bound, which is very close
to the euclidean situation, and a uniform diameter bound, we show that there
exists a subsequence which converges in the Gromov-Hausdor sense to an
Einstein manifold.

To prove these results, we use Jeffrey Streets' L2-curvature 
ow. In particular, we use his ``tubular averaging technique" in order to prove fine distance
estimates of this flow which only depend on significant geometric bounds.

Every group admits at least one action by isometries on a hyperbolic metric space, and certain classes of groups admit many different actions on different hyperbolic metric spaces (in fact, often uncountably many).  One such class of groups is the class of so-called acylindrically hyperbolic groups, which contains many interesting groups, such as mapping class groups, Out(F_n), and right-angled Artin and Coxeter groups, among many others.  In this talk, I will describe how to put a partial order on the set of actions of a given group on hyperbolic spaces which, in some sense, measures how much information about the group the action provides.  This partial order defines a "poset of actions" of the given group.  I will then define the class of acylindrically hyperbolic groups and give some structural properties of the resulting poset of actions for such groups.  In particular, I will discuss for which (classes of) groups the poset contains a largest element.

How should you read your TA evaluations?  How do I read them?  I'd like to talk about this and I'd also like to review the first half of the seminar, talking about questions like "What was the main point of the Week ? meeting?".

Suppose f is an n-variate polynomial with integer coefficients and degree d. Many natural computational problems involving the real zero set Z of f are algorithmically difficult. For instance, no known algorithm for computing the number of connected components of Z has complexity polynomial in n+d. Furthermore, no known general algorithm for deciding whether f has root over the p-adic has sub-exponential complexity. So it is worthwhile to seek families of polynomials where these questions are tractable.

Assuming f has n+2 monomial terms, and its exponent vectors do not all lie on an affine hyperplane, we prove that the isotopy type of Z can be determined in time polynomial in log d, for any fixed n. (This family of polynomials --- polynomials supported on circuits ---is highly non-trivial, since it already includes Weierstrass normal forms and several important examples from semi-definite programming.) We also show that a 1998 refinement of the abc-Conjecture (by Baker) implies that our algorithm is polynomial in n as well. Furthermore, the original abc-Conjecture implies that p-adic rational roots for f can be detected in the complexity class NP.

     These results were obtained in collaboration with Kaitlyn Phillipson and Daqing Wan.