Fri, 02 May 2025

14:00 - 15:00
L1

Dealing with Exam Anxiety

Abstract

This session, led by the Counselling Service,  will guide you through a CBT informed understanding of anxiety, which may arise about exams. The session includes:

  • Psychoeducation - what is happening in the brain and body when we worry about exams
  • Paradox of worry – how more pressure, makes studying less likely
  • Experiential exercises – management strategies to maintain focus and engagement
  • Takeaway tools – a collection of managing stress skills for self-guided practice
  • Practical tips – enhance your exam preparation
Wed, 24 Jan 2024
15:30

.

(Oxford University)
Wed, 30 Apr 2025
15:30
C1

Uniqueness of gauge covariant renormalisation of stochastic 3D Yang-Mills

Ilya Chevyrev
(University of Edinburgh)
Abstract

In this talk, I will describe a family of observables for 3D quantum Yang-Mills theory based on regularising connections with the YM heat flow. I will describe how these observables can be used to show that there is a unique renormalisation of the stochastic quantisation equation of YM in 3D that preserves gauge symmetries. This complements a recent result on the existence of such a renormalisation. Based on joint work with Hao Shen.

Tue, 27 May 2025

10:30 - 17:30
L3

One-Day Meeting in Combinatorics

Multiple
Further Information

The speakers are Yuval Wigderson (ETH Zurich), Liana Yepremyan (Emory), Dan Kráľ (Leipzig University and MPI-MiS), Marthe Bonamy (Bordeaux), and Agelos Georgakopoulos (Warwick). Please see the event website for further details including titles, abstracts, and timings. Anyone interested is welcome to attend, and no registration is required.

Tue, 17 Jun 2025

14:00 - 15:00
L4

The Maze Problem

Imre Leader
(University of Cambridge)
Abstract

Do there exist universal sequences for all mazes on the two-dimensional integer lattice? We will give background on this question, as well as some recent results. Joint work with Mariaclara Ragosta.

Tue, 10 Jun 2025

14:00 - 15:00
L4

SDP, MaxCut, Discrepancy, and the Log-Rank Conjecture

Benny Sudakov
(ETH Zurich)
Abstract

Semidefinite programming (SDP) is a powerful tool in the design of approximation algorithms. After providing a gentle introduction to the basics of this method, I will explore a different facet of SDP and show how it can be used to derive short and elegant proofs of both classical and new estimates related to the MaxCut problem and discrepancy theory in graphs and matrices.

Building on this, I will demonstrate how these results lead to an improved upper bound on the celebrated log-rank conjecture in communication complexity.

Tue, 13 May 2025

14:00 - 15:00
L4

Frame matroids with a distinguished frame element

James Davies
(University of Cambridge)
Abstract

A matroid is frame if it can be extended such that it possesses a basis $B$ (a frame) such that every element is spanned by at most two elements of $B$. Frame matroids extend the class of graphic matroids and also have natural graphical representations. We characterise the inequivalent graphical representations of 3-connected frame matroids that have a fixed element $\ell$ in their frame $B$. One consequence is a polynomial time recognition algorithm for frame matroids with a distinguished frame element.

Joint work with Jim Geelen and Cynthia Rodríquez.

Subscribe to