University of Oxford

We will recall basic definitions and facts about homogeneous Riemannian manifolds and we will discuss the Einstein condition on this kind of spaces. In particular, we will talk about non existence results of invariant Einstein metrics. Finally, we will talk briefly about the Ricci flow equation in the homogeneous setting.

The representation theory of the symmetric groups is far more advanced than that of arbitrary finite groups. The blocks of symmetric groups with defect group of order pⁿ are classified, in the sense that there is a finite list of possible Morita equivalence types of blocks, and it is relatively straightforward to write down a representative from each class.

In this talk we will look at the case where n=2. Here the theory is fairly well understood. After introducing combinatorial wizardry such as cores, the abacus, and Scopes moves, we will see a new result, namely that the simple modules for any p-block of weight 2 "come from" (technically, have isomorphic sources to) simple modules for S_2p or the wreath product of S_p and C₂.

A K3 surface of degree two can be seen as a double cover of the complex projective plane, ramified over a nonsingular sextic curve. In this talk we explore two different methods for constructing explicit projective models of threefolds admitting a fibration by such surfaces, and discuss their relative merits.

This talk will be divided into three parts. In the first part we will recall basic notions and facts of differential geometry and the Ricci flow equation. In the second part we will talk about singularities for the Ricci flow and Ricci flow on homogeneous spaces. Finally, in the third part

of the talk, we will focus on the case of Ricci flow on compact homogeneous spaces with two isotropy summands.

I will give an introduction to Kashiwara's theory of crystal bases. Crystals are combinatorial objects associated to integrable modules for quantum groups that, together with the related notion of crystal bases, capture several combinatorial aspects of their representation theory.

I will give a short introduction to non-standard analysis using Nelson's Internal Set Theory, and attempt to give some interesting examples of what can be done in NSA. If time permits I will look at building models for IST inside the usual ZFC set theory using ultrapowers.

In this talk we will survey some aspects of social choice theory: in particular, various impossibility theorems about voting systems and strategies. We begin with the famous Arrow's impossibility theorem -- proving the non-existence of a 'fair' voting system -- before moving on to later developments, such as the Gibbard–Satterthwaite theorem, which states that all 'reasonable' voting systems are subject to tactical voting.

Given time, we will study extensions of impossibility theorems to micro-economic situations, and common strategies in game theory given the non-existence of optimal solutions.

From a categorical point of view, the standard Zermelo-Frankel set theoretic approach to the foundations of mathematics is fundamentally deficient: it is based on the notion of equality of objects in a set. Equalities between objects are not preserved by equivalences of categories, and thus the notion of equality is 'incorrect' in category theory. It should be replaced by the notion of 'isomorphism'.

Moving higher up the categorical ladder, the notion of isomorphism between objects is 'incorrect' from the point of view of 2-category, and should be replaced by the notion of 'equivalence'...

Recently, people have started to take seriously the idea that one should be less dogmatic about working with set-theoretic axiomatisiations of mathematics, and adopt the more fluid point of view that different foundations of mathematics might be better suited to different areas of mathematics. In particular, there are currently serious attempts to develop foundations for mathematics built on homotopy types, or, in another language, ∞-groupoids.

An (∞,1)-topos should admit an internal 'homotopical logic', just as an ordinary (1-)topos admits an internal logic modelling set theory.

It turns out that formalising such a logic is rather closely related to the problem of finding good foundations for 'intensional dependent type theory' in theoretical computer science/logic. This is sometimes referred to as the attempt to construct a 'homotopy lambda calculus'.

It is expected that a homotopy theoretic formalisation of the foundations of mathematics would be of genuine practical significance to the average mathematician!

In this talk we will give an introduction to these ideas, and to the recent work of Vladimir Voevodsky and others in this area.

We will investigate what one can detect about a discrete group from its profinite completion, with an emphasis on considering geometric properties.