Photos of them

Two Oxford Mathematicians, Andrew Wiles and Marc Lackenby, have received Basic Science and Frontiers of Science awards.

Andrew receives a Basic Science Lifetime Award both for his famous proving of Fermat's Last Theorem and its subsequent influence on the development of the field, and for the inspiration he has provided to many aspiring mathematicians.

Evolution of an epidemic: Understanding the opioid epidemic in the United States and the impact of the COVID-19 pandemic on opioid-related mortality
Laing, R Donnelly, C PLoS ONE volume 19 issue 7 (09 Jul 2024)
A Lipid-Structured Model of Atherosclerosis with Macrophage Proliferation
Chambers, K Watson, M Myerscough, M Bulletin of Mathematical Biology volume 86 issue 8 (09 Jul 2024)
Stable liftings of polynomial traces on tetrahedra
Parker, C Suli, E Foundations of Computational Mathematics
Ancient Egyptian mathematics in the early 20th century: a mathematical view from Kiel, 1926
Hollings, C Parkinson, R British Journal for the History of Mathematics
Characterization of the astrophysical diffuse neutrino flux using starting track events in IceCube
Abbasi, R Ackermann, M Adams, J Agarwalla, S Aguilar, J Ahlers, M Alameddine, J Amin, N Andeen, K Anton, G Argüelles, C Ashida, Y Athanasiadou, S Ausborm, L Axani, S Bai, X Balagopal, A Baricevic, M Barwick, S Bash, S Basu, V Bay, R Beatty, J Tjus, J Beise, J Bellenghi, C Benning, C BenZvi, S Berley, D Bernardini, E Besson, D Blaufuss, E Blot, S Bontempo, F Book, J Meneguolo, C Böser, S Botner, O Böttcher, J Braun, J Brinson, B Brostean-Kaiser, J Brusa, L Burley, R Busse, R Butterfield, D Campana, M Caracas, I Carloni, K Carpio, J Physical Review D volume 110 issue 2 (02 Jul 2024)
Abraham Robertson, the Binomial Theorem, and the nature of plagiarism in mathematics
Hollings, C American Mathematical Monthly
Tue, 03 Dec 2024
15:00
L6

Short loxodromics in graph products

Alice Kerr
(University of Bristol)
Abstract
Let G be a finitely generated group, with finite generating set S. Suppose G contains elements with some property that we’re interested in.  Can we find elements with this property uniformly quickly in G? That is, does S^n contain an element with this property for a bounded n?
 
We will discuss this question for graph products, where the elements we are looking for are ones with nice hyperbolic properties, such as loxodromic and Morse elements. We will also talk about consequences for the growth of these groups. This is joint work with Elia Fioravanti.

 
Tue, 26 Nov 2024
15:00
L6

Embedding products of trees into higher rank

Oussama Bensaid
Abstract

I will present a joint work with Thang Nguyen where we show that there exists a quasi-isometric embedding of the product of n copies of the hyperbolic plane into any symmetric space of non-compact type of rank n, and there exists a bi-Lipschitz embedding of the product of n copies of the 3-regular tree into any thick Euclidean building of rank n. This extends a previous result of Fisher--Whyte. The proof is purely geometrical, and the result also applies to the non Bruhat--Tits buildings. I will start by describing the objects and the embeddings, and then give a detailed sketch of the proof in rank 2.

Tue, 19 Nov 2024
15:00
L6

Studying monoids that model concurrency

Sarah Rees
(University of Newcastle)
Abstract

I’ll discuss joint work of mine with with Ascencio-Martin, Britnell, Duncan, Francoeurs and Koutny to set up and study algebraic models of concurrent computation. 

Trace monoids were introduced by Mazurkiewicz as algebraic models of Petri nets, where some pairs of actions can be applied in either of two orders and have the same effect. Abstractly, a trace monoid is simply a right-angled Artin monoid. More recently Koutny et al. introduced the concept of a step trace monoid, which allows the additional possibility that a pair of actions may have the same effect performed simultaneously as sequentially. 

I shall introduce these monoids, discuss some problems we’d like to be able to solve, and the methods with which we are trying to solve them. In particular I’ll discuss normal forms for traces, comtraces and step traces, and generalisations of Stallings folding techniques for finitely presented groups and monoids.

Subscribe to