Oxford University

Manifolds, the main objects of study in Differential Geometry, do not have nice categorical properties. For example, the category of manifolds with smooth maps does not contain all fibre products.
The algebraic counterparts to this (varieties and schemes) do have nice categorical properties. 

A method to ‘fix’ these categorical issues is to consider C^infinity schemes, which generalise the category of manifolds using algebraic geometry techniques. I will explain these concepts, and how to translate to manifolds with corners, which is joint work with my supervisor Professor Dominic Joyce.

Quiver varieties are an attractive research topic of many branches of contemporary mathematics - (geometric) representation theory, (hyper)Kähler differential geometry, (symplectic) algebraic geometry and quantum algebra.

In the talk, I will define different types of quiver varieties, along with some interesting examples. Afterwards, I will focus on Nakajima quiver varieties (hyperkähler moduli spaces obtained from framed-double-quiver representations), stating main results on their topology and geometry. If the time permits, I will say a bit about the symplectic topology of them.

This talk will be a gentle introduction to braided fusion categories, with the eventual aim to explain a result from my thesis about symmetric fusion categories. 

Fusion categories are certain kinds of monoidal categories. They can be viewed as a categorification of the finite dimensional algebras, and appear in low-dimensional topological quantum field theories, as well as being studied in their own right. A braided fusion category is additionally commutative up to a natural isomorphism, symmetry is an additional condition on this natural isomorphism. Computations in these categories can be done pictorially, using so-called string diagrams (also known as ``those cool pictures''). 

In this talk I will introduce fusion categories using these string diagrams. I will then discuss the Drinfeld centre construction that takes a fusion category and returns a braided fusion category. We then show, if the input is a symmetric fusion category, that this Drinfeld centre carries an additional tensor product. All of this also serves as a good excuse to draw lots of pictures.
 

We develop a general purpose solver for quadratic programs based on operator splitting. We introduce a novel splitting that requires the solution of a quasi-definite linear system with the same coefficient matrix in each iteration. The resulting algorithm is very robust, and once the initial factorization is carried out, division free; it also eliminates requirements on the problem data such as positive definiteness of the objective function or linear independence of the constraint functions. Moreover, it is able to detect primal or dual infeasible problems providing infeasibility certificates. The method supports caching the factorization of the quasi-definite system and warm starting, making it efficient for solving parametrized problems arising in finance, control, and machine learning. Our open-source C implementation OSQP has a small footprint and is library-free. Numerical benchmarks on problems arising from several application domains show that OSQP is typically 10x faster than interior-point methods, especially when factorization caching or warm start is used.

This is joint work with Goran Banjac, Paul Goulart, Alberto Bemporad and Stephen Boyd
 

In this talk two different methods for constructing complete steady and expanding Ricci solitons of cohomogeneity one will be discussed. The first is based on an estimate on the growth of the soliton potential and holds for large classes of cohomogeneity one manifolds. The second approach is specific to the two summands case and uses a Lyapunov function. This method also carries over to the Einstein case and as an application, a simplified construction of B\"ohm's Einstein metrics of positive scalar curvature on spheres will be explained.

Prime numbers have intrigued, inspired and infuriated mathematicians for millennia and yet mathematicians' difficulty with answering simple questions about them reveals their depth and subtlety. 

Join Vicky to learn about recent progress towards proving the famous Twin Primes Conjecture and to hear the very different ways in which these breakthroughs have been made - a solo mathematician working in isolation, a young mathematician displaying creativity at the start of a career, a large collaboration that reveals much about how mathematicians go about their work.  

Vicky Neale is Whitehead Lecturer at the Mathematical Institute, University of Oxford and Supernumerary Fellow at Balliol College.

Please email @email to register.

The $r$-neighbour bootstrap process on a graph $G$ starts with an initial set of "infected" vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a vertex becomes infected, it remains infected forever). If every vertex of $G$ becomes infected during the process, then we say that the initial set percolates.

In this talk I will discuss the proof of a conjecture of Balogh and Bollobás: for fixed $r$ and $d\to\infty$, the minimum cardinality of a percolating set in the $d$-dimensional hypercube is $\frac{1+o(1)}{r}\binom{d}{r-1}$. One of the key ideas behind the proof exploits a connection between bootstrap percolation and weak saturation. This is joint work with Jonathan Noel.

Understanding the spatial distribution of organisms throughout an environment is an important topic in population ecology. We briefly review ecological questions underpinning certain mathematical work that has been done in this area, before presenting a few examples of spatially structured population models. As a first example, we consider a model of two species aggregation and clustering in two-dimensional domains in the presence of heterogeneity, and demonstrate novel aggregation mechanisms in this setting. We next consider a second example consisting of a predator-prey-subsidy model in a spatially continuous domain where the spatial distribution of the subsidy influences the stability and spatial structure of steady states of the system. Finally, we discuss ongoing work on extending such results to network-structured domains, and discuss how and when the presence of a subsidy can stabilize predator-prey dynamics."

-------------------------------------------------------------------------------------------------------------------------------

Compaction is a primary process in the evolution of a sedimentary basin. Various 1D models exist to model a basin compacting due to overburden load. We explore a multi-dimensional model for a basin undergoing mechanical and chemical compaction. We discuss some properties of our model. Some test cases in the presence of geological features are considered, with appropriate numerical techniques presented.

I will discuss the specific long-time behaviour of kinetic solutions to stochastic conservation laws with non-linear multiplicative noises.

The talk will describe accelerated algorithms for computing full or partial matrix factorizations such as the eigenvalue decomposition, the QR factorization, etc. The key technical novelty is the use of  randomized projections to reduce the effective dimensionality of  intermediate steps in the computation. The resulting algorithms execute faster on modern hardware than traditional algorithms, and are particularly well suited for processing very large data sets.

The algorithms described are supported by a rigorous mathematical analysis that exploits recent work in random matrix theory. The talk will briefly review some representative theoretical results.