Reconfiguring Graph Homomorphisms on the Sphere

Given a loop-free graph $H$, the reconfiguration problem for homomorphisms to $H$ (also called $H$-colourings) asks: given two $H$-colourings $f$ of $g$ of a graph $G$, is it possible to transform $f$ into $g$ by a sequence of single-vertex colour changes such that every intermediate mapping is an $H$-colouring? This problem is known to be polynomial-time solvable for a wide variety of graphs $H$ (e.g. all $C_4$-free graphs) but only a handful of hard cases are known. We prove that this problem is PSPACE-complete whenever $H$ is a $K_{2,3}$-free quadrangulation of the $2$-sphere (equivalently, the plane) which is not a $4$-cycle. From this result, we deduce an analogous statement for non-bipartite $K_{2,3}$-free quadrangulations of the projective plane. This include several interesting classes of graphs, such as odd wheels, for which the complexity was known, and $4$-chromatic generalized Mycielski graphs, for which it was not. If we instead consider graphs $G$ and $H$ with loops on every vertex (i.e. reflexive graphs), then the reconfiguration problem is defined in a similar way except that a vertex can only change its colour to a neighbour of its current colour. In this setting, we use similar ideas to show that the reconfiguration problem for $H$-colourings is PSPACE-complete whenever $H$ is a reflexive $K_{4}$-free triangulation of the $2$-sphere which is not a reflexive triangle. This proof applies more generally to reflexive graphs which, roughly speaking, resemble a triangulation locally around a particular vertex. This provides the first graphs for which $H$-Recolouring is known to be PSPACE-complete for reflexive instances.Comment: 22 pages, 9 figure

The first international workshop on the role and impact of mathematics in medicine: a collective account

The First International Workshop on The Role and Impact of Mathematics in Medicine (RIMM) convened in Paris in June 2010. A broad range of researchers discussed the difficulties, challenges and opportunities faced by those wishing to see mathematical methods contribute to improved medical outcomes. Finding mechanisms for inter- disciplinary meetings, developing a common language, staying focused on the medical problem at hand, deriving realistic mathematical solutions, obtainin

Comparing placentas from normal and abnormal pregnancies

This report describes work carried out at a Mathematics-in-Medicine Study Group. It is believed that placenta shape villous network characteristics are strongly linked to the placenta’s efficiency, and hence to pregnancy outcome. We were asked to consider mathematical ways to describe the shape and other characteristics of a placenta, as well as forming mathematical models for placenta development. In this report we propose a number of possible measure of placental shape, form, and efficiency, which can be computed from images already obtained. We also consider various models for the early development of placentas and the growth of the villous tree