A family of expanders is a sequence of finite graphs which are both sparse and highly connected. Firstly defined in the 80s, they had huge applications in applied maths and computer science. Moreover, it soon turned out that they also had deep implications in pure maths. In this talk I will introduce the expander graphs and I will illustrate a way to construct them by approximating actions of groups on probability spaces.

I want to give an introduction into non-Archimedean Geometry, and show how Model Theory was used to prove the recent results of Hrushovski-Loeser on topological properties of analytic spaces. This may also be of interest with view towards Zilber's programme for syntax-semantics dualities.

Leinster and Willerton have introduced the concept of the magnitude of a metric space, as a special case as that of an enriched category. It is a numerical invariant which is designed to capture the important geometric information about the space, but concrete examples of ts values on compact sets in euclidean space have hitherto been lacking. We discuss progress in some conjectures of Leinster and Willerton.

 On November 25th 1915 Albert Einstein submitted his famous paper on the General Theory of Relativity. David Hilbert also derived the General Theory in November 1915 using quite different methods. In the same year Emmy Noether derived her remarkable ‘Noether’s Theorem’ which lies at the heart of much modern Physics. 1915 was a very good vintage indeed. We will take a brief walking tour of General Relativity using some of the ideas of Noether, Hilbert and Einstein to examine gravitational redshift, gravitational lensing, the impact of General Relativity on GPS systems and high precision atomic clocks, and Black holes all of which can be summarised by asking ‘how long is a piece of spacetime?’ 

Trusted Platform Modules (TPMs) are currently used in large numbers of computers. In this talk, I will discuss the cryptographic algorithms supported by the current version of the Trusted Platform Modules (Version 1.2) and also those due to be included in the new version  (Version 2.0).  After briefly introducing the history of TPMs, and the difference between these two generations TPMs, I will focus on the challenges faced in developing Direct Anonymous Attestation (DAA) an algorithmic scheme designed to preserve privacy and included in TPMs.