The Erdős–Ko–Rado theorem is a central result in extremal set theory which tells us how large uniform intersecting families can be. In this talk, I shall discuss some recent results concerning the 'stability' of this result. One possible formulation of the Erdős–Ko–Rado theorem is the following: if $n \ge 2r$, then the size of the largest independent set of the Kneser graph $K(n,r)$ is $\binom{n-1}{r-1}$, where $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\dots,n\}$ in which two sets are adjacent if and only if they are disjoint. The following will be the question of interest. Delete the edges of the Kneser graph with some probability, independently of each other: is the independence number of this random graph equal to the independence number of the Kneser graph itself? I shall discuss an affirmative answer to this question in a few different regimes. Joint work with Bollobás and Raigorodskii, and Balogh and Bollobás.

A system of linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, there is a monochromatic solution. The finite partition regular systems were completely characterised by Rado in terms of a simple property of their matrix of coefficients. As a result, finite partition regular systems are very well understood.

Much less is known about infinite systems. In fact, only a very few families of infinite partition regular systems are known. I'll explain a relatively new method of constructing infinite partition regular systems, and describe how it has been applied to settle some basic questions in the area.

A graph is quasirandom if its edge distribution is similar (in a well defined quantitative way) to that of a random graph with the same edge density. Classical results of Thomason and Chung-Graham-Wilson show that a variety of graph properties are equivalent to quasirandomness. On the other hand, in some known proofs the error terms which measure quasirandomness can change quite dramatically when going from one property to another which might be problematic in some applications.

Simonovits and Sós proved that the property that all induced subgraphs have about the expected number of copies of a fixed graph $H$ is quasirandom. However, their proof relies on the regularity lemma and gives a very weak estimate. They asked to find a new proof for this result with a better estimate. The purpose of this talk is to accomplish this.

Joint work with D. Conlon and J. Fox

It has become possible in recent years to provide unconditional lower bounds on the time needed to perform a number of basic computational operations. I will briefly discuss some of the main techniques involved and show how one in particular, the information transfer method, can be exploited to give  time lower bounds for computation on streaming data.

I will then go on to present a simple looking mathematical conjecture with a probabilistic combinatorics flavour that derives from this work.  The conjecture is related to the classic "coin weighing with a spring scale" puzzle but has so far resisted our best efforts at resolution.

An edge (vertex) coloured graph is rainbow-connected if there is a rainbow path between any two vertices, i.e. a path all of whose edges (internal vertices) carry distinct colours. Rainbow edge (vertex) connectivity of a graph G is the smallest number of colours needed for a rainbow edge (vertex) colouring of G. We propose a very simple approach to studying rainbow connectivity in graphs. Using this idea, we give a unified proof of several new and known results, focusing on random regular graphs. This is joint work with Michael Krivelevich and Benny Sudakov.

This will be an overview of Prof Stroffolini's research and precursor to the eight-hour mini-course Prof Stroffolini will be giving later in October.

Milnor has shown that three-dimensional Lie groups with left invariant Riemannian metrics furnish examples of 3-manifolds with principal Ricci curvatures of fixed signature --- except for the signatures (-,+,+), (0,+,-), and (0,+,+).  We examine these three cases on a Riemannian 3-manifold, and prove global obstructions in certain cases.  For example, if the manifold is closed, then the signature (-,+,+) is not globally possible if it is of the form -µ,f,f, with µ a positive constant and f a smooth function that never takes the values 0,-µ (this generalizes a result by Yamato '91).  Similar obstructions for the other cases will also be discussed.  Our methods of proof rely upon frame techniques inspired by the Newman-Penrose formalism.  Thus, we will close by turning our attention to four dimensions and Lorentzian geometry, to uncover a relation between null vector fields and exact symplectic forms, with relations to Weinstein structures. 

I will discuss theta-stability, a framework for analyzing moduli problems in algebraic geometry by finding a special kind of stratification called a theta-stratification, a notion which generalizes the Kempf-Ness stratification in geometric invariant theory and the Harder-Narasimhan-Shatz stratification of the moduli of vector bundles on a Riemann surface.

We present McEliece encryption scheme and some well-known proposals based on various families of error correcting codes. We introduce several methods for cryptanalysis in order to study the security of the presented proposals.