Maximum relative distance between real rank-two and rank-one tensors
Abstract
We investigate the maximum distance of a rank-two tensor to rank-one tensors. An equivalent problem is given by the minimal ratio of spectral and Frobenius norm of a tensor. For matrices the distance of a rank k matrix to a rank r matrices is determined by its singular values, but since there is a lack of a fitting analog of the singular value decomposition for tensors, this question is more difficult in the regime of tensors.
Supporting pure maths research in Africa
Pitching soap films
Abstract
This talk is about the mathematics behind an artistic project focusing on the vibrations of soap films.
Propagation and stability of stress-affected transformation fronts in solids
Abstract
There is a wide range of problems in continuum mechanics that involve transformation fronts, which are non-stationary interfaces between two different phases in a phase-transforming or a chemically-transforming material. From the mathematical point of view, the considered problems are represented by systems of non-linear PDEs with discontinuities across non-stationary interfaces, kinetics of which depend on the solution of the PDEs. Such problems have a significant industrial relevance – an example of a transformation front is the localised stress-affected chemical reaction in Li-ion batteries with Si-based anodes. Since the kinetics of the transformation fronts depends on the continuum fields, the transformation front propagation can be decelerated and even blocked by the mechanical stresses. This talk will focus on three topics: (1) the stability of the transformation fronts in the vicinity of the equilibrium position for the chemo-mechanical problem, (2) a fictitious-domain finite-element method (CutFEM) for solving non-linear PDEs with transformation fronts and (3) an applied problem of Si lithiation.
14:00
Colouring locally sparse graphs with the first moment method
Abstract
A classical theorem of Molloy and Johansson states that if a graph is triangle free and has maximum degree at most $\Delta$, then it has chromatic number at most $\frac{\Delta}{\log \Delta}$. This was extended to graphs with few edges in their neighbourhoods by Alon-Krivelevich and Sudakov, and to list chromatic number by Vu. I will give a full and self-contained proof of these results that relies only on induction and the first moment method.