Chirality, the property that an object cannot be superimposed on its mirror image, arises across all scientific disciplines, yet its ultimate origin remains one of the central open questions in Nature. Both fundamental and elusive, chirality plays a decisive role in shaping the structure and behaviour of natural systems. Starting from its classical geometric definition and the long-standing challenge of defining meaningful measures of chirality, this talk develops a natural extension of the concept to field theories by examining the physical response of chiral bodies immersed in fluid flows. This framework leads to a further novel concept in which chirality is attached not only to objects, but also to their smooth deformations. I will address the general problems of chirality, its quantification, and its transfer across scales, trace their historical development, and illustrate the theory through examples drawn from fluid mechanics, chemistry, and biology, revealing unifying principles with some surprising twists.

Koszul duality is a powerful mathematical construction.  In this talk, I will take a physical perspective to demonstrate one instance of this duality: an algebraic approach to coupling quantum field theories to a quantum mechanical system on a line.  I will explain how a Lagrangian coupling results in an algebraic object, called a Maurer-Cartan element, and show that there is a sense in which the Koszul dual to the algebra of local operators gives a “universal coupling”.  I will then describe what Koszul duality really “is”, and why many other mathematical constructions deserve the same name.

Junior Strings is a seminar series where DPhil students present topics of common interest that do not necessarily overlap with their own research area. This is primarily aimedl at PhD students and post-docs but everyone is welcome.

A temporal graph $G$ is a sequence of graphs $G_1, G_2, \ldots, G_t$ on the same vertex set. In this talk, we are interested in the analogue of the Travelling Salesman Problem for temporal graphs. It is referred to in the literature as the Temporal Exploration Problem, and asks for the minimum length of an exploration of the graph, that is, a sequence of vertices such that at each time step $t$, one either stays at the same vertex or moves along a single edge of $G_t$.

One natural and still open case is when each graph $G_t$ is connected and has bounded maximum degree. We present a short proof that any such graph admits an exploration in $O(n^{3/2}\sqrt{\log n})$ time steps. In fact, we deduce this result from a more general statement by introducing the notion of average temporal maximum degree. This more general statement improves the previous best bounds, under a unified approach, for several studied exploration problems.

This is based on joint work with Carla Groenland, Lukas Michel and Clément Rambaud.