Bodleian iSkills workshops are available to all University of Oxford students, researchers, academics and other staff. The details for all our workshops are available on our website along with the booking links.
Image: Eye - M. C. Escher
quantization
12:00
Strong convergence of the vorticities in the 2D viscosity limit on a bounded domain
Abstract
In the vanishing viscosity limit from the Navier-Stokes to Euler equations on domains with boundaries, a main difficulty comes from the mismatch of boundary conditions and, consequently, the possible formation of a boundary layer. Within a purely interior framework, Constantin and Vicol showed that the two-dimensional viscosity limit is justified for any arbitrary but finite time under the assumption that on each compactly contained subset of the domain, the enstrophies are bounded uniformly along the viscosity sequence. Within this framework, we upgrade to local strong convergence of the vorticities under a similar assumption on the p-enstrophies, p > 2. The talk is based on a recent publication with Christian Seis and Emil Wiedemann.
This is the thirteenth year for MPLS Impact Awards, which celebrate, recognise and reward impacts achieved by researchers. The annual awards aim to foster, raise awareness of, and reward impact at a local level, and prepare the ground for the impact case studies that will be needed for future REF and similar exercises.
14:00
Hodge Learning on Higher-Order Networks
Abstract
The discrete Hodge Laplacian offers a way to extract network topology and geometry from higher-ordered networks. The operator is inspired by concepts from algebraic topology and differential geometry and generalises the graph Laplacian. In particular, it allows to relate global structure of networks to the local properties of nodes. In my talk, I will talk about some general behaviour of the Hodge Laplacian and then continue to show how to use the extracted information to a) to use trajectory data infer the topology of the underlying network while simultaneously classifying the trajectories and b) to extract cell differentiation trees from single-cell data, an exciting new application in computational genomics.
16:00
Fridays@4 – Multiply Your Impact: Talking to the Public Creatively
Abstract

Normal covering numbers for groups and connections to additive combinatorics
Abstract
The normal covering number $\gamma(G)$ of a finite group $G$ is the minimal size of a collection of proper subgroups whose conjugates cover the group. This definition is motivated by number theory and related to the concept of intersective polynomials. For the symmetric and alternating groups we will see how these numbers are closely connected to some elementary (as in "relating to basic concepts", not "easy") problems in additive combinatorics, and we will use this connection to better understand the asymptotics of $\gamma(S_n)$ and $\gamma(A_n)$ as $n$ tends to infinity.
Talking to the public about your research can be extremely rewarding, but it's not always clear how to get involved as an early career researcher.
Join Joshua Bull and James Munro to explore imaginative ideas for public engagement and learn about how you could turn your own ideas into reality this year with a share of up to £3k in seed funding.
All attendees are invited to discuss potential project ideas over free pizza and drinks after the session.