The paper “Time-dependent conformal mapping of doubly-connected regions” co-authored by Matt Turner and Tom Bridges, has been accepted for publication in the Springer journal Advances in Computational Mathematics. The paper studies the evolution of the conformal modulus, an invariant associated with conformal mapping of doubly-connected regions, and develops a generalization of the Hilbert transform, named […]
Read more
Congratulations to Euan Littlejohns who passed his PhD Confirmation Examination today (Friday 18 December). The title of his report is “Mathematically modelling biological growth“. His supervisors are Carina Dunlop and Anne Skeldon, and the examiners were Gianne Derks and Matt Turner.
Read more
Alessandro Torrielli visited the Istituto Nazionale de Fisica Nucleare at the University of Turin this week, giving a talk on Monday 14 December on “Lower dimensional AdS/CFT correspondences and their integrability“. In the talk he gave an overview of AdS/CFT correspondences in dimensions lower than or equal to 5, with emphasis on their integrable structure. […]
Read more
Congratulations to Jon Pennant who passed his PhD viva today with minor corrections. The title of his thesis is “On infinite energy solutions to dissipative PDEs in unbounded domains” and the work was supervised by Sergey Zelik. The external examiner was Thierry Gallay from the University of Grenoble and the internal examiner was Claudia Wulff.
Read more
Gianne Derks is co-organiser of a week-long workshop on Mathematical Pharmacology, held at the Lorentz Center in Leiden, the Netherlands, from 20 November to 4 December. The other organisers are Pinky Dua (Cambridge), Piet Hein van der Graaf (Leiden), Coen van Hasselt (Leiden), and Vivi Rottschafer (Leiden). The workshop brings together mathematicians and pharmacologists from […]
Read more
Ian Morris visited the Mathematical Institute, University of Oxford, yesterday (Thursday 26 November) to give a talk in the seminar of the Number Theory Group. His talk was on “The central limit theorem for the number of steps in the Euclidean algorithm“. Abstract: The number of steps required by the Euclidean algorithm to find the […]
Read more
