13:30
Short- and long-time existence for a non-compact parabolic Monge-Ampère equation
Abstract
12:00
Thermal Giant Graviton Expansion
Abstract
12:00
Cohomology of Oriented Grassmannians
Abstract
We will present results on cohomology rings of (oriented) Grassmannians, and see some of the techniques for the computations in these rings.
The ECM viscoelasticity controls tissue spatiotemporal dynamics
Abstract
The acquisition and maintenance of the correct cellular pattern and tissue architecture is essential for organ function in multicellular organisms. Beyond generating the required cellular diversity, developing tissues need to attain the appropriate morphology. Tissue architecture is built through symmetry breaking instabilities such as folding, branching, buckling or budding. Studying single-cell responses alone is not enough to reveal the mesoscale physical and biochemical processes that regulate tissue organization and morphology over time and scale. In our lab we investigate how the interaction between the extracellular matrix (ECM) and tissues regulates processes during development and cancer, with a focus on ECM mechanical properties. While most research in this domain has concentrated on the ECM's elasticity as a primary determinant of cell and tissue behaviour, it is important to note that the ECM possesses both viscous and elastic properties. I will present our findings demonstrating that the passive viscoelastic properties of the ECM regulate tissue architecture and patterning both during development and cancer. Specifically, we show that ECM viscoelasticity influences the spatial and temporal organization of multicellular tissues in breast and intestinal organoids. Overall, our work highlights the critical role of viscoelasticity in driving morphological symmetry breaking instabilities, a fundamental process in morphogenesis and oncogenesis, and suggests ways of controlling tissue through ECM mechanics.
The ECM viscoelasticity controls tissue spatiotemporal dynamics
Abstract
The acquisition and maintenance of the correct cellular pattern and tissue architecture is essential for organ function in multicellular organisms. Beyond generating the required cellular diversity, developing tissues need to attain the appropriate morphology. Tissue architecture is built through symmetry breaking instabilities such as folding, branching, buckling or budding. Studying single-cell responses alone is not enough to reveal the mesoscale physical and biochemical processes that regulate tissue organization and morphology over time and scale. In our lab we investigate how the interaction between the extracellular matrix (ECM) and tissues regulates processes during development and cancer, with a focus on ECM mechanical properties. While most research in this domain has concentrated on the ECM's elasticity as a primary determinant of cell and tissue behaviour, it is important to note that the ECM possesses both viscous and elastic properties. I will present our findings demonstrating that the passive viscoelastic properties of the ECM regulate tissue architecture and patterning both during development and cancer. Specifically, we show that ECM viscoelasticity influences the spatial and temporal organization of multicellular tissues in breast and intestinal organoids. Overall, our work highlights the critical role of viscoelasticity in driving morphological symmetry breaking instabilities, a fundamental process in morphogenesis and oncogenesis, and suggests ways of controlling tissue through ECM mechanics.
17:00
Hilbert's 10th Problem over $\mathbb{Q}$
Abstract
Multi-Index Monte Carlo variance analysis for McKean–Vlasov Stochastic Differential Equations
Abstract
McKean–Vlasov stochastic differential equations (MKV SDEs) are stochastic differential equations whose coefficients depend on both the solution and its law. They arise in various applications in mathematical finance, including models of systemic risk. Their numerical approximation typically involves two discretisation parameters: the time-step size and the number of particles used to approximate the solution's law.
Multi-index Monte Carlo (MIMC) methods exploit this two-parameter structure to reduce the computational cost of Monte Carlo simulations. Haji-Ali and Tempone derived complexity bounds for MIMC approximation of MKV SDEs, assuming certain variance decay rates.
In this talk, we present a rigorous variance analysis for the MIMC method applied to MKV SDEs with additive noise. We explain the main ideas behind the analysis and show how the resulting bounds relate to the method's computational complexity. We complement our theoretical analysis with numerical experiments investigating the variance decay rates.
This talk is based on joint work with Mike Giles and Yuying Zhao.
16:00
Non-unirational Hilbert Irreducibility for Hilbert Modular Surfaces
Abstract
We establish non-unirational versions of Hilbert Irreducibility for all Hilbert modular surfaces which are of K3 type. As an application we prove new instances of the regular Inverse Galois Problem for the simple groups PSL2(GF(p)^2) subject to congruence conditions on p. Joint work with J. Demeio.
Efficient localised model reduction for multiscale PDEs via Grassmannian Interpolation
Abstract
Professor Rob Scheichl will talk about: 'Efficient localised model reduction for multiscale PDEs via Grassmannian Interpolation'
Multiscale Spectral Generalized Finite Element Methods (MS-GFEM) are a powerful new discretisation method for general variational problems that satisfy a Gårding-type inequality, including strongly non-Hermitian problems. The construction of optimal approximation spaces is localised and requires no a priori regularity assumptions. The global approximation error is controlled by the local errors, which are rigorously shown to decay nearly exponentially. The optimality hinges on an SVD of the local restriction operator in a suitable, coefficient-dependent inner product on an oversampled patch. Compactness of this operator in the space of a-harmonic functions guarantees spectral accuracy akin to Weyl asymptotics for the Laplacian. As such, MS-GFEM can be seen as an “hp-version” of Localized Orthogonal Decomposition (LOD). Given the coefficient function the local approximation spaces can be constructed efficiently. In this talk, I will show how we can use Grassmannian interpolation of the resulting local approximation spaces on sparse grids in high dimensions to derive localized model order reduction methods that inherit the nearly exponential spatial and parametric convergence of MS-GFEM and of sparse grids, respectively. I will show some numerical experiments confirming the theoretical results in the context of elliptic problems.
On the symmetric Morrey problem in three dimensions
Abstract
The existence of minimizers in the calculus of variations is closely tied to various notions of convexity. A fundamental question in this regard is how these notions relate to each other.
In this talk, we study several such generalized notions of convexity for continuous integrands on the space of symmetric $3\times 3$ matrices and establish their mutual relationships.
In particular, we construct a symmetric quasiconvex integrand that is not polyconvex at symmetric matrices, and an integrand that is both symmetric rank-one convex and Hessian quasiconvex but not symmetric quasiconvex. We also establish a transfer principle that converts smooth rank-one convex functions that fail to be Hessian quasiconvex into symmetric rank-one convex integrands while preserving this failure. Applying this scheme to existing counterexamples, we obtain symmetric rank-one convex integrands that are not Hessian quasiconvex. Together with previous results, this settles all pairwise implications among the notions considered here.
DPhil Talks
Abstract
Maria Reboredo Prado
Stratosphere-Troposphere Interactions: Understanding how the Upper Atmosphere Shapes the Weather and Climate We See.
It is well known that the stratosphere – the second layer of the atmosphere – can exert a powerful influence on weather and climate at the surface. This influence is particularly important in winter, when the strength of the stratospheric polar vortex — a belt of fast-moving winds encircling the pole — can vary dramatically. If the impacts of these variations on the lower atmosphere were better understood and more accurately represented in forecast models, they could provide early signals of winter weather patterns, improving predictions on subseasonal to seasonal timescales. Yet, the mechanisms by which changes high in the atmosphere produce a response near the surface remain poorly understood.
In this talk, I will use an idealised atmospheric model to test how much of this downward effect can be explained by large-scale balanced dynamics. The model allows individual processes – such as atmospheric cooling, surface friction, and boundary effects – to be switched on or off, making it possible to assess their relative roles in shaping the surface response. A key improvement on previous theoretical models is that the displacement of the tropopause — the boundary between the troposphere and stratosphere – emerges naturally as part of the flow’s response to forcing. Overall, this framework provides a controlled setting for identifying the dynamical mechanisms that transmit stratospheric disturbances to the surface.
Orson Hart
Inertialess instability of viscosity-stratified Couette flow
In this talk, we discuss the stability of viscosity-stratified Couette flow. By neglecting inertia, we isolate the destabilising effect of viscosity stratification on a fluid configuration consisting of three layers of immiscible, incompressible fluid. We show how the linear stability analysis can be simplified by considering symmetric flow configurations and, by considering disturbances of arbitrary wavelength, we identify a new instability mechanism that is only induced by finite-wavelength disturbances.
Vedanta Thapar
Embedding complex networks with the random walk first return time distribution
We consider the problem of network embedding, specifically we propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any pair of nodes using standard metrics for discrete distributions. We present several arguments to motivate the FRTD embedding. First, we show that FRTDs are strictly more informative than eigenvalue spectra, yet insufficient for complete graph identification, thus placing FRTD equivalence between cospectrality and isomorphism. Second, we argue that FRTD equivalence between nodes captures structural similarity. Third, we empirically demonstrate that the FRTD embedding outperforms manually designed graph metrics in network alignment tasks. Finally, we show that random networks that approximately match the FRTD of a desired target also preserve other salient features. Together these results demonstrate the FRTD as a simple and mathematically principled embedding for complex networks.
Chun Lam Li
Neural network augmentation of the Maxey-Riley equation for Particle-Laden Flows
Fluid-particle interactions in low-Reynolds-number confined flows govern many biological and engineering processes, including microthrombi transport in cerebral microvessels and particle separation in microfluidic devices. Fully resolved direct numerical simulations (DNS) are accurate but costly for small particle sizes and large numbers of particles, limiting the simulation and analysis of particle-laden flows. We develop a machine learning (ML) model based upon the Maxey-Riley (M-R) equation to provide fast predictions of particle motion. A key feature is that the ML model is physics-based; neural networks learn corrections to an M-R based model to improve its predictions beyond the conditions for which it was derived. We consider a single spherical particle moving between two parallel plates, with plane Poiseuille flow as the undisturbed flow. The problem is parametrized by the flow Reynolds number, particle-to-fluid density ratio, confinement ratio (particle diameter to channel height), and initial wall-normal position. The model is trained on particle velocities from DNS sampled at discrete time points, and evaluated on trajectories that were not used for training. The ML model improves prediction accuracy of particle trajectories over the uncorrected M-R baseline across the tested physical parameters, at a far lower computational cost than DNS.
work with Justin Sirignano1, and Sarah L. Waters1
1. Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK
Multiscale Spectral Generalised Finite Elements: Preconditioning and Model Reduction Beyond SPD
Abstract
Christian Alber will talk about 'Multiscale Spectral Generalised Finite Elements: Preconditioning and Model Reduction Beyond SPD'
Multiscale PDEs with heterogeneous, highly oscillatory coefficients can be challenging for standard numerical methods. This talk presents a framework for the design and analysis of the Multiscale Spectral Generalised Finite Element Method (MS-GFEM), a partition of unity method using optimal local approximation spaces constructed from eigenproblems. These spaces are closely related to GenEO coarse spaces in domain decomposition. Under suitable assumptions, we establish nearly exponential local approximation rates and describe their dependence on problem parameters. We also discuss how the resulting coarse spaces can be used in two-level domain decomposition preconditioners. Applications to Helmholtz and Stokes problems illustrate the approach beyond the symmetric positive definite setting, with numerical experiments complementing the analysis.
11:00
The gamma-function in a pseudo-finite and a pseudo-analytic settings
Abstract
16:00
One-Relator Products of Left-Orderable Groups
Abstract
11:30
Finiteness Properties and the Virtual Surjection Conjecture
Abstract
Uniqueness of the infinite volume $\Phi^4_3$ measure up to critical temperature
Abstract
16:00
Integrable Systems, Generalized Hydrodynamics, and Random Matrix Theory
Abstract
Roughly a decade ago the Euler hydrodynamic equations were written down for integrable many-body systems. Since the number of conserved fields is extensive, the Euler equations form an infinite array of hyperbolic conservation laws. For my talk, I will focus on the Toda lattice. Since initial conditions are random, the respective Lax matrix is random. As to be explained, random matrix theory enters through determining the density of states and investigating the motion of eigenvectors.
16:00
Integrable Systems, Generalized Hydrodynamics, and Random Matrix Theory
Abstract
Roughly a decade ago the Euler hydrodynamic equations were written down for integrable many-body systems. Since the number of conserved fields is extensive, the Euler equations form an infinite array of hyperbolic conservation laws. For my talk, I will focus on the Toda lattice. Since initial conditions are random, the respective Lax matrix is random. As to be explained, random matrix theory enters through determining the density of states and investigating the motion of eigenvectors.
16:00
Toeplitz Operators on the Fock Space and the Berger-Coburn Conjecture
Abstract
In 1994, Berger and Coburn showed that a Toeplitz operator on the Fock space is bounded if the heat transform of its symbol is bounded at some time 0<t<1/4, and that boundedness of the operator implies boundedness of the heat transform for 1/4<t<1. They conjectured that boundedness of the operator is equivalent to boundedness of the heat transform at the critical time t=1/4. While the conjecture holds for several classes of symbols, we show that both implications fail in general. Our counterexamples come from Baire category and closed graph arguments, which yield no explicit symbols. I will also explain a sharp positive result: trace-class membership guarantees a bounded heat transform at the critical time, whereas membership in larger Schatten classes does not.
15:30
Curves: embedded and parametrised
Abstract
I will revisit the relation between Hilbert schemes of curves in a threefold X and spaces of stable maps to X from the perspective of wall-crossing. The expectation is that there exist proper spaces of embedded nodal curves in semistable degenerations of X that admit wall-crossings to both theories. I will sketch a construction of such spaces for a product threefold S x C, in curve classes that are non-zero on the second factor.
Embedding networks with the random walk first return time distribution
Abstract
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any pair of nodes using standard metrics for discrete distributions. We present several arguments to motivate the FRTD embedding. First, we show that FRTDs are strictly more informative than eigenvalue spectra, yet insufficient for complete graph identification, thus placing FRTD equivalence between cospectrality and isomorphism. Second, we argue that FRTD equivalence between nodes captures structural similarity. Third, we empirically demonstrate that the FRTD embedding outperforms manually designed graph metrics in network alignment tasks. Finally, we show that random networks that approximately match the FRTD of a desired target also preserve other salient features. Together these results demonstrate the FRTD as a simple and mathematically principled embedding for complex networks.
15:00
Rigidity properties of mapping class groups and their random quotients
Abstract
14:00
Cycles with almost linearly many chords
Abstract
How large must the average degree of a graph be to force a cycle with as many chords as vertices? Chen, Erdős and Staton conjectured in 1996 that a sufficiently large constant suffices. In this talk, I will sketch a proof that sufficiently large constant minimum degree guarantees a cycle of length $\ell$ with $\Omega(\ell/(\log \ell)^C)$ chords, for an absolute constant $C>0$. This comes within a polylogarithmic factor of the conjecture and answers a related question of Dvořák, Martins, Thomassé and Trotignon for graphs of sufficiently large minimum degree.
This is joint work with Nemanja Draganić.
14:00
Codimension-4 singularities in nilpotent orbit closures and symmetric pairs
Abstract
13:00
The Rise and Fall of Black Hole Interiors: From Geometry to Krylov Complexity
Abstract
Modelling brain clearance across scales
Abstract
Brain activity produces waste proteins such as amyloid-β, whose accumulation is an early hallmark of Alzheimer’s disease. Amyloid-β dynamics are governed by cell-scale processes, namely production at neurons, diffusion and aggregation in the extracellular space, and receptor-mediated transport across the blood–brain barrier. The resulting accumulation, however, plays out at the tissue scale.
In this talk, we introduce a multi-species reaction–diffusion model in a periodically perforated domain, which is coupled to nonlinear receptor dynamics on capillary surfaces. Since the receptors do not diffuse, they lack spatial regularity, which makes the analysis more delicate. We prove well-posedness with uniform L∞ bounds and, using two-scale convergence, derive an effective macroscopic model. Its diffusion tensor comes from a cell problem, surface processes become volume sources, and the receptors remain a cell-scale variable. Numerical experiments show that, at fixed porosity, the shape and curvature of cells alone can change the effective transport by tens of percent.
Quantitative classification of potential unforced Navier-Stokes singularities beyond the blow-up time
Abstract
On fraudulent stochastic algorithms
Abstract
15:30
PL recognition after two $S^2\times S^2$ stabilisations is PSPACE-hard
Abstract
Let $Z$ be any fixed closed connected PL 4-manifold. We give a reduction from the compressed word problem in Thompson's group $F$ to fixed-target recognition of $Z\#_2(S^2\times S^2)$. Once a finite triangulation of $Z$ has been fixed, the construction sends a straight-line program $A$ to a closed triangulated PL 4-manifold $X_{A,Z}$ such that a designated output word $\operatorname{val}(A)$ is equal to the identity in $F$ if and only if $X_{A,Z}$ is PL-homeomorphic to $Z\#_2(S^2\times S^2)$. The compressed word problem in $F$ has been shown to be PSPACE-complete, and so every such recognition problem is PSPACE-hard. In particular, fixed-target recognition of $\#_n(S^2\times S^2)$ is PSPACE-hard for every fixed $n\geq 2$.
14:15
Geometry on $G_2$ manifolds with a calibrated distribution
Abstract
13:30
A New Construction for Non-Compact $G_2$ Manifolds
Abstract
Constructing $G_2$ manifolds is a notoriously difficult task. Taking inspiration from physics, one can try to reverse engineer new $G_2$ manifolds by geometrising, via M-theory, the flux torus construction of 4d $\mathcal{N}=1$ quiver gauge theories. The resulting $G_2$ manifolds are described by highly non-trivial fibrations of an elliptically fibered Calabi-Yau threefold over a circle. In this talk I will describe the construction of a new infinite family of non-compact $G_2$ manifolds arising from flux torus compactifications of the rank 1 E-string theory. This talk will focus on the geometry and not the physics of this construction. Based on arXiv 2608.21238.
13:00
Choosing the geometry
Abstract
Finitely presented multiparameter persistence modules are a natural target category for encoding homological invariants, but comparing such modules requires choosing a notion of distance. Our goal is to develop a zoo of distances on multiparameter persistence modules, capturing both the algebraic features of the representation category as well as the geometry of the parameter space. The parameters of this construction make the comparison flexible by capturing different notions of noise and similarity. This is joint work with Jens Agerberg and Wojciech Chachólski.
Craft Session
Abstract
Make mathematical crafts and get to know other Mathematrix members! Materials provided.
12:00
How to make the most of your tutorials
Abstract
This session will look at how you can get the most out of your lectures and tutorials. We’ll talk about how to prepare effectively, make lectures more productive, and understand what tutors expect from you during tutorials. You’ll leave with practical tips to help you study more confidently and make your learning time count.
This session is likely to be most relevant for first-year undergraduates, but all are welcome.
Remodelling selection to debias population research
Abstract
Every population consists of individuals who vary in their traits, and each trait may, or may not, be associated with frailty or fitness. Variation in frailty and fitness traits makes population studies prone to selective depletion bias (SDB). The issue is widespread across scientific domains. When an ageing cohort exhibits declining mortality, is it individuals becoming healthier or selective depletion of the frail? In an epidemic, when growth in cumulative infections decelerates, is it individuals cautiously changing behaviour or selective depletion of the most susceptible? In microbial populations, when mutations increase population vulnerability to stress, it is individuals becoming more vulnerable or mutant populations having higher variance in fitness? In each case, the first explanation invokes individuals changing, while the second recognises that populations change due to selection on pre-existing variation. While the former are intuitive and widely adopted, explanations that rely on selective depletion are more neutral and less commonly considered due to cognitive biases and challenges in estimating all variation that matters.
Remodelling selection (ReMS) is proposed as a general strategy of study design and analysis to address the SDB problem. I will show how the approach has been employed in specific case studies and how it has been formalised in general.
17:00
Affine logic and the geometry of simplices of invariant measures
Abstract
I will discuss an application to probability theory (more precisely, to the theory of exchangeable random variables) of recent developments in affine logic, the fragment of continuous logic in which only affine connectives are allowed.
An affine theory is simplicial if its type spaces, which are always compact convex sets, form Choquet simplices. A remarkable dichotomy holds: for a complete simplicial theory, either all type spaces are Bauer simplices (i.e., the set of extreme points is closed) or they are all Poulsen simplices (i.e., the extreme points are dense).
On the other hand, simplices of invariant measures arising in ergodic theory and probability theory can be represented as *quantifier-free* type spaces of appropriate universal affine theories. I will discuss a quantifier-free adaptation of the dichotomy result mentioned above and its application to the geometry of certain simplices of invariant measures arising in exchangeability theory. Relative property (T) for Polish groups will play an important role.
Credit Risk Behind The Smile
Abstract
16:00
On p-ordinary, mod p local Langlands correspondences
Abstract
The established mod p local Langlands correspondence is a representation of GL2(Qp) that is associated to a local Galois representation and that occurs in the cohomology of the modular curve. It is believed that more general correspondences occur but, as of yet, this remains open. Examples of these generalisations would be representations of GLn(Qp) that are associated to higher dimensional Galois representations and that occur in the cohomology of suitable arithmetic manifolds.
In this talk, I will discuss joint work with Shu Sasaki in which we construct a purely local framework for associating a mod p representation of GLn(Qp) to the data of a mod p Galois representation whose image lives in a Borel subgroup (a mod p, p-ordinary Galois representation). We will see how our construction is motivated by earlier work of Breuil and Herzig and why we hope to use our framework to generalise their mod p results to include non generic cases.
State time geometry: causal performance profiles and optimal data transport in parallel execution
Abstract
Dr Peter Braam is going to talk about; 'State time geometry: causal performance profiles and optimal data transport in parallel execution'
The increasing complexity of parallel architectures and heterogeneous microarchitectures makes predicting and optimising program performance notoriously difficult. For Optimal Data Transport, we present a discrete variant of the Wasserstein–Fisher–Rao metric that quantifies the true cost of data layout transformations and movement across memory hierarchies. For Causal Performance Profiles, we introduce the Lyons–Gregg Signature, which combines the ideas of Terry Lyons' rough path signatures with hardware performance counters (eBPF) to capture cross-correlated, causal bottlenecks in execution streams. Both arose from State Time Geometry (STG), a model for stateful program execution on computing infrastructure, first modelled as a dynamical system governing state-values over the space of memory addresses. The address space generalises to geometric objects defining infrastructure and leads to the metric. The state transitions of parallel executions become a Grothendieck quantum field theory over the infrastructure and carry the statistical model for the Lyons-Gregg Signature. The central theme is that an intuitive faithful model is not doomed by complexity but forms a geometric domain in which both theoretical and engineering perspectives are simplified.
(In a companion lecture in the Computing Laboratory at 11:00 on Nov 13, we will discuss STG's underlying categorical and geometric structure and its relationship to programming languages and formal methods)
13:30
Understanding Chiral Holography
Abstract
Chiral holography constructs a gravitational dual of N=4 self-dual Yang-Mills (SDYM), which provides a holographic duality at zero 't Hooft coupling. The top-down construction begins by considering the twistor string and its D-branes, whose world-volume theory is the twistor uplift of SDYM. In this talk, I will review twistor theory, the holographic setup, and how local spacetime operators manifest on twistor space. This talk is based on https://arxiv.org/pdf/2512.04152.
Uniform Integrability and the Problem of Pressure Formation for Euler-Riesz Systems
Abstract
Nyström is better
Abstract
Zheng Tang (Mathematical Institute, University of Oxford) is going to talk about: "Nyström is better"
Abstract: Subspace methods are widely used for computing a few eigenvalues and eigenvectors of large symmetric matrices. These methods first construct a low-dimensional subspace and then extract approximate eigenpairs from it. The Rayleigh–Ritz method is the standard approach for the extraction step and has several classical optimality properties. For positive semidefinite matrices, however, the Nyström method, widely used for low-rank approximation of kernel matrices in machine learning, provides an alternative that can achieve significantly higher accuracy at the same asymptotic computational cost.
In this talk, we compare the eigenvalue extraction errors of different subspace projection methods, including Rayleigh-Ritz and Nyström, and investigate the potential accuracy improvement. We show that the improvement can be significant under certain spectral conditions. We also discuss how our results apply when the low-dimensional search subspace is constructed by subspace iteration or Krylov subspace methods.
Pattern formation beneath glaciers
Abstract
Underneath large glaciers and ice sheets, water flows through a permeable network of cavities and channels, held open by melting the ice above balancing the downwards flow of ice. Dissipation within the water flow is a significant enough source of heat that instabilities can develop if the flow rate is high enough, eroding large channels that rapidly drain water from the glacier bed. I will present a model for the system, and discuss the linear problem, observational evidence for the stability criterion, and the non-linear interactions that rapidly become the dominant control on channel spacing. Recently, there has been some discussion of slowing glaciers down by pumping water out from under them - I will consider the viability of this strategy in view of the results in this talk.
Kasia Warburton works on understanding the flow of glaciers and ice sheets (Antarctica and Greenland) using fluid dynamics. She studies the flow of water and sediment underneath the ice that control how fast the ice moves.
11:00
Existence over an arid predicate
Abstract
17:00
Does mathematics have anything to do with biology? - Philip Maini
No two subjects in the sciences are presented as being more different than mathematics and biology, so this is a very fair question to ask, especially as here, "mathematics" does not include statistics, while "biology" includes physiology, medicine etc. This talk will illustrate how mathematics has had a profound impact in biology.
Examples will include Alan Turing's groundbreaking work on biological pattern formation (which Philip has actually applied to football shirt patterns), Alan Hodgkin and Andrew Huxley's Nobel Prize winning explanation for neuronal signalling, and potentially new therapies for certain cancers.
Philip Maini is Professor of Mathematical Biology and Director of the Wolfson Centre for Mathematical Biology in Oxford.
Please email @email to register to attend in person.
The lecture will be broadcast on the Oxford Mathematics YouTube Channel on Wednesday 02 December at 5-6 pm and any time after (no need to register for the online version).
The Oxford Mathematics Public Lectures are generously supported by XTX Markets.
16:00
Distortion, Snowflake Groups, and the Conjugator Length Spectrum
Abstract
We show that the conjugator length spectrum of finitely presented groups contains every rational number in [1, ∞︎). In particular, this shows there is no gap in the conjugator length spectrum, which is in contrast to isoperimetric spectra. Our construction relies on upgrading distortion of cyclic subgroups to conjugator length functions, which we apply to snowflake groups.