A group splits as an HNN-extension if and only if the rank of its abelianisation is strictly positive. If we fix a class of groups one may ask a few questions about these splittings: How distorted are the vertex and edge groups? What form can the vertex and edge groups take? If they remain in our fixed class, do they also split? If so, under iteration will we terminate at something nice? In this talk we will answer all these questions for the class of one-relator groups and go through an example or two. Time permitting, we will also discuss possible generalisations to groups with staggered presentations.

We will answer the following question: given a finite simplicial complex X acted on by a finite group G, which object stores the minimal amount of information about the symmetries of X in such a way that we can reconstruct both X and the group action? The natural first guess would be the quotient X/G, which remembers one representative from each orbit. However, it does not tell us the size of each orbit or how to glue together simplices to recover X. Our desired object is, in fact, a complex of groups. We will understand two processes: compression and reconstruction and see primarily through an example how to answer our initial question.

The mapping class group of a surface is a group of homeomorphisms of that surface, and these groups have been very well studied in the last 50 years. The talk will be focused on a way to understand such a group by looking at the subsurfaces of the corresponding surface; this is the so-called "Masur-Minsky hierarchy machinery". We'll finish with a non-technical discussion of hierarchically hyperbolic groups, which are a popular area of current research, and of which mapping class groups are important motivating examples. No prior knowledge of the objects involved will be assumed.

Every Cayley graph of a finitely generated group has some basic properties: they are locally finite, connected, and vertex-transitive. These are not sufficient conditions, there are some well known examples of graphs that have all these properties but are non-Cayley. These examples do however "look like" Cayley graphs, which leads to the natural question of if there exist any vertex-transitive graphs that are completely unlike any Cayley graph. I plan to give some of the history of this question, as well as the construction of the example that finally answered it.

Mirror symmetry, in a crude formulation, is usually presented as a correspondence between curve counting on a Calabi-Yau variety X, and some invariants extracted from a mirror family of Calabi-Yau varieties. After the physicists Bershadsky-Cecotti-Ooguri-Vafa (henceforth BCOV), this is organised according to the genus of the curves in X we wish to enumerate, and gives rise to an infinite recurrence of differential equations. In this talk, I will give a general introduction to these problems, and present a rigorous mathematical formulation of the BCOV conjecture at genus one, in terms of a lifting of the Grothendieck-Riemann-Roch. I will explain the main ideas of the proof of the conjecture for Calabi-Yau hypersurfaces in projective space, based on the Riemann-Roch theorem in Arakelov geometry. Our results generalise from dimension 3 to arbitrary dimensions previous work of Fang-Lu-Yoshikawa.
 

This is joint work with G. Freixas and C. Mourougane.

The challenge is to produce a reduced order model which predicts the maximum temperature rise of a thermally conducting object subjected to a power deposition profile supplied by an external code. The target conducting object is basically cuboidal but with one or more shaped faces and may have complex internal cooling structures, the deposition profile may be time dependent and exhibit hot spots and sharp edged shadows among other features. An additional feature is the importance of radiation which makes the problem nonlinear, and investigation of control strategies is also of interest. Overall there appears to be a sequence of problems of degree of difficulty sufficient to tax the most gifted student, starting with a line profile on a cuboid (quasi-2D) with linearised radiation term, and moving towards increased difficulty.

We consider estimation of ordinary differential equation (ODE) models from noisy observations. For this problem, one conventional approach is to fit numerical solutions (e.g., Euler, Runge–Kutta) of ODEs to data. However, such a method does not account for the discretization error in numerical solutions and has limited estimation accuracy. In this study, we develop an estimation method that quantifies the discretization error based on data. The key idea is to model the discretization error as random variables and estimate their variance simultaneously with the ODE parameter. The proposed method has the form of iteratively reweighted least squares, where the discretization error variance is updated with the isotonic regression algorithm and the ODE parameter is updated by solving a weighted least squares problem using the adjoint system. Experimental results demonstrate that the proposed method improves estimation accuracy by accounting for the discretization error in a data-driven manner. This is a joint work with Yuto Miyatake (Osaka University).

The Alternating Directions Method of Multipliers (ADMM) is a widely popular first-order method for solving convex optimization problems. Its simplicity is arguably one of the main reasons for its popularity. For a broad class of problems, ADMM iterates by repeatedly solving perhaps the two most standard Linear Algebra problems: linear systems and symmetric eigenproblems. In this talk, we discuss how employing standard Krylov-subspace methods for ADMM can lead to tenfold speedups while retaining convergence guarantees.