We show how to get coarse bounds on the number of (non-simple) closed geodesics on a surface, given upper bounds on both length and self-intersection number. Recent work by Mirzakhani and by Rivin has produced asymptotics for the growth of the number of simple closed curves and curves with one self-intersection (respectively) with respect to length. However, no asymptotics, or even bounds, were previously known for other bounds on self-intersection number. Time permitting, we will discuss some applications of this result

Shear Thickening fluids such as cornstarch and water show remarkable response under impact, which allows, for example, a person to run on the surface of the suspension. We perform constant velocity impact experiments along with imaging and particle tracking in a shear thickening fluid at velocities lower than 500 mm/s and suspension heights of a few cm. In this regime, where inertial effects are insignificant, we find that a solid-like dynamically jammed region with a propagating front is generated under impact. The suspension is able to support large stresses like a solid only when the front reaches the opposite boundary. These impact-activated fronts are generated only above a critical velocity. We construct a model by taking into account that sufficiently large stresses are generated when this solid like region spans to the opposite boundary and the work necessary to deform this solid like material dissipates the kinetic energy of the impacting object. The model shows quantitative agreement of the measured penetration depth using high speed video of a person running on cornstarch and water suspensions.

I plan to discuss finite time singularities for the harmonic map heat flow and describe a beautiful example of winding behaviour due to Peter Topping.

I will report on some joint work with Jacob Tsimerman
concerning multiplicative relations among singular moduli.
Our results rely on the ``Ax-Schanuel'' theorem for the j-function
recently proved by us, which I will describe.

Phylogenies, or evolutionary histories, play a central role in modern biology, illustrating the interrelationships between species, and also aiding the prediction of structural, physiological, and biochemical properties. The reconstruction of the underlying evolutionary history from a set of morphological characters or biomolecular sequences is difficult since the optimality criteria favored by biologists are NP-hard, and the space of possible answers is huge. Phylogenies are often modeled by trees with n leaves, and the number of possible phylogenetic trees is $(2n-5)!!$. Due to the hardness and the large number of possible answers, clever searching techniques and heuristics are used to estimate the underlying tree.

We explore the combinatorial structure of the underlying space of trees, under different metrics, in particular the nearest-neighbor-interchange (NNI), subtree- prune-and-regraft (SPR), tree-bisection-and-reconnection (TBR), and Robinson-Foulds (RF) distances.  Further, we examine the interplay between the metric chosen and the difficulty of the search for the optimal tree.

How many $H$-free graphs are there on $n$ vertices? What is the typical structure of such a graph $G$? And how do these answers change if we restrict the number of edges of $G$? In this talk I will describe some recent progress on these basic and classical questions, focusing on the cases $H=K_{r+1}$ and $H=C_{2k}$. The key tools are the hypergraph container method, the Janson inequalities, and some new "balanced" supersaturation results. The techniques are quite general, and can be used to study similar questions about objects such sum-free sets, antichains and metric spaces.

I will mention joint work with a number of different coauthors, including Jozsi Balogh, Wojciech Samotij, David Saxton, Lutz Warnke and Mauricio Collares Neto.