We consider the homogenisation problem for the ϕ4/2 equation on the torus T² , i.e. the behaviour as ϵ → 0 of the solutions to the equations suggestively written

∂_tu_ϵ − ∇ · A(x/ϵ, t/ϵ² )∇uϵ = −u³_ϵ + ξ

where ξ denotes space-time white noise and A : T ² × R is uniformly elliptic, periodic and H¨older continuous. Based on joint work with M. Hairer

The mapping class group of a surface has a hierarchical structure in which the geometry of the group can be seen by examining its action on the curve graph of every subsurface. This behavior was one of the motivating examples for a generalization of hyperbolicity called hierarchical hyperbolicity. Hierarchical hyperbolicity has many desirable consequences, but the definition is long, and proving that a group satisfies it is generally difficult. This difficulty motivated the introduction of a new condition called combinatorial hierarchical hyperbolicity by Behrstock, Hagen, Martin, and Sisto in 2020 which implies the original and is more straightforward to check. In recent work, Hagen, Mangioni, and Sisto developed a method for building a combinatorial hierarchically hyperbolic structure from a (sufficiently nice) hierarchically hyperbolic one. The goal of this talk is to describe their construction in the case of the mapping class group and illustrate some of the parallels between the combinatorial structure and the original. 

You may be surprised to see the generalised Riemann hypothesis appear in algorithmic topology. For example, knottedness was originally shown to be in NP under the assumption of GRH.
Where does this condition come from? We will discuss this in the context of 3-sphere recognition, and examine why the approach fails for higher dimensions.

It is a truth universally acknowledged, that an infinite group in possession of a good algebraic structure, must be in want of a hyperbolic space to act on. For the mapping class group of a surface, one of the most popular choices is the curve graph. This is a combinatorial object, built from curves on the surface and intersection patterns between them.
Hyperbolicity of the curve graph was proved by Masur and Minsky in a celebrated paper in 1999. In the same article, they showed how the geometry of the action on this graph reflects dynamical/topological properties of the mapping class group; in particular, loxodromic elements are precisely the pseudo-Anosov mapping classes.
In light of this, one would like to better understand distances in the curve graph. The graph is locally infinite, and finding a shortest path between two vertices is highly non-trivial. In this talk, we will see how to use the machinery of train tracks to overcome this issue and compute (approximate) distances in the curve graph. If time permits -- which, somehow, it never does -- we will also analyse this construction from an algorithmic perspective.

An old and challenging conjecture proposed by R.H. Fox in 1962 states that the absolute values of the coefficients of the Alexander polynomial of an alternating knot are trapezoidal i.e. strictly increase, possibly plateau, then strictly decrease. We give a survey of the known results and use them to motivate the study of branched double covers. The second part of the talk focuses on the properties of the branched double covers of alternating knots.

The space of subgroups of a countable group is a compact topological space which encodes many of the properties of its non-free actions. We will discuss some approaches to studying the Cantor-Bendixson decomposition of this space in the context of hyperbolic groups and groups which act (nicely) on trees. We will also give some conditions under which the conjugation action on the perfect kernel is highly topologically transitive and see how this can be applied to find new examples of groups (including all virtually compact special groups) which admit faithful transitive amenable actions. This is joint work with Damien Gaboriau.