Tue, 02 Jun 2026

10:30 - 17:30
L3

One-Day Meeting in Combinatorics

Multiple
Further Information

The speakers are Penny Haxell (Waterloo), Guus Regts (University of Amsterdam), Annika Heckel (Uppsala), Standa Živný (Oxford), and Romain Tessera (Institut de Mathématiques de Jussieu-Paris Rive Gauche). Please see the event website for further details including titles, abstracts, and timings. Anyone interested is welcome to attend, and no registration is required.

Thu, 21 May 2026
12:00
Lecture Room 4, Mathematical Institute

A Runtime-Data-Driven Enhancement Preconditioner for PCG for a Sequence of SPD Linear Systems

Jing-Yuan Wang
(University of Macau)
Abstract

In this work, we propose a runtime-data-driven enhancement preconditioner for improving the convergence of a preconditioned conjugate gradient method for solving a sequence of symmetric positive definite linear systems of equations. The methodology is designed for the situation where a subset of the systems has been solved and the convergence is considered too slow. In such a situation, data generated from the solved problems (residual vectors, intermediate solution vectors, approximate error vectors) are first analyzed by an unsupervised learning algorithm as a 3-step process: (1) dimension reduction; (2) classification of the slow features; (3) construction of projections to each of the feature subspaces. Based on the results of the analysis, one or more enhancement preconditioners are constructed using projection matrices corresponding to the features extracted from the slow convergence subspaces. The enhancement preconditioners are additively incorporated into the existing preconditioners and are employed to solve other systems in the sequence. The enhancement preconditioner can be further enhanced when necessary by repeating this process. Numerical experiments for time-dependent problems, including parabolic and hyperbolic equations, and stochastic elliptic equations demonstrate that the proposed approach improves the convergence considerably for other systems in the sequence when classical preconditioners are insufficient.

Tue, 19 May 2026
14:00
Online

Diameter of Random Spanning Trees in Random Environment

Rongfeng Sun
(National University of Singapore)
Abstract

We introduce a new spanning tree model which we call Random Spanning Trees in Random Environment (RSTRE), which was introduced independently by A. Kúsz. As the inverse temperature beta varies in the underlying Gibbs measure, it interpolates between the uniform spanning tree and the minimum spanning tree. On the complete graph with n vertices, we show that with high probability, the diameter of the random spanning tree is of order n1/2 when β=o(n/log n), and is of order n1/3 when β > n4/3 log n. We conjecture that the diameter exponent linearly interpolates between these two regimes as the power exponent of beta varies. Based on joint work with L. Makowiec and M. Salvi.


 

Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Tue, 05 May 2026
14:00
L5

On the Erdős-Rogers function

Julian Sahasrabudhe
(University of Cambridge)
Abstract
In this talk I will discuss some recent progress on a natural relative of the classical Ramsey problem, introduced by Erdős and Rogers. What is the largest K_s-free subset that can be found in every K_{s+1}-free graph on n vertices?
This is based on joint work with Rob Morris and Jacques Verstraete.
Fri, 01 May 2026
12:00
Quillen Room N3.12

TPPTPP is currently looking for bright students to join our close-knit technical team, this diverse role will allow you to kick start your career in the tech industry.

Subscribe to