Thu, 26 Nov 2015
11:00
C5

JOINT LOGIC/PHILOSOPHY OF MATHEMATICS SEMINAR: Modal Logics of multiverses

Benedikt Loewe
(Amserdam)
Abstract

 If you fix a class of models and a construction method that allows you to construct a new model in that class from an old model in that class, you can consider the Kripke frame generated from any given model by iterating that construction method and define the modal logic of that Kripke frame.  We shall give a general definition of these modal logics in the fully abstract setting and then apply these ideas in a number of cases.  Of particular interest is the case where we consider the class of models of ZFC with the construction method of forcing:  in this case, we are looking at the so-called "generic multiverse".

Wed, 02 Dec 2015
16:00
C1

Quasihomomorphisms with non-commutative target

Nicolaus Heuer
(Oxford)
Abstract

Quasihomomorphisms (QHMs) are maps $f$ between groups such that the
homomorphic condition is boundedly satisfied. The case of QHMs with
abelian target is well studied and is useful for computing the second
bounded cohomology of groups. The case of target non-abelian has,
however, not been studied a lot.

We will see a technique for classifying QHMs $f: G \rightarrow H$ by Fujiwara and
Kapovich. We will give examples (sometimes with proofs!) for QHM in
various cases such as

  • the image $H$  hyperbolic groups,
  • the image $H$ discrete rank one isometries,
  • the preimage $G$ cyclic / free group, etc.

Furthermore, we point out a relation between QHM and extensions by short
exact sequences.

Wed, 25 Nov 2015
16:00
C1

Expanders and actions on measure spaces

Federico Vigolo
(Oxford)
Abstract

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.

Mon, 02 Nov 2015
17:00
L3

Non-Archimedean Analytic Geometry..etc.

Nicholas Wentzlaff
Abstract

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.

Mon, 16 Nov 2015

15:00 - 16:00
L2

Magnitudes of compact sets in euclidean spaces: an application of analysis to the theory of enriched categories

Tony Carbery
(University of Edinburgh)
Abstract

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.

Tue, 24 Nov 2015

14:00 - 14:30
L5

Numerical calculation of permanents

Peter McCullagh
(University of Chicago)
Abstract
The $\alpha$-permanent of a square matrix is a determinant-style sum, with $\alpha=-1$ corresponding to the determinant, $\alpha=1$ to the ordinary permanent, and $\alpha=0$ to the Hamiltonian sum over cyclic permutations.  Exact computation of permanents is notoriously difficult; numerical computation using the best algorithm for $\alpha=1$ is feasible for matrices of order about 25--30; numerical computation for general $\alpha$ is feasible only for $n < 12$.  I will describe briefly how the $\alpha$-permanent arises in statistical work as the probability density function of the Boson point process, and I will discuss the level of numerical accuracy needed for statistical applications.  My hope is that, for sufficiently large matrices, it may be possible to develop a non-stochastic polynomial-time approximation of adequate accuracy.
Mon, 23 Nov 2015

17:00 - 18:00
St Catherine's

How Long is a Piece of Spacetime

Professor Philip Bond
(Quantitative Software Consulting)
Abstract

 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?’ 

Mon, 16 Nov 2015

16:00 - 17:00
L2

The Stokes-Fourier equations as scaling limit of the hard sphere dynamics

Laure Saint-Raymond
(Ecole Normale Superieure)
Abstract
In his sixth problem, Hilbert asked for an axiomatization of gas dynamics, and he suggested to use the Boltzmann equation as an intermediate description between the (microscopic) atomic dynamics and (macroscopic) fluid models. The main difficulty to achieve this program is to prove the asymptotic decorrelation between the local microscopic interactions, referred to as propagation of chaos, on a time scale much larger than the mean free time. This is indeed the key property to observe some relaxation towards local thermodynamic equilibrium.

 

This control of the collision process can be obtained in fluctuation regimes. In a recent work with I. Gallagher and T. Bodineau, we have established a long time convergence result to the linearized Boltzmann equation, and eventually derived the acoustic and incompressible Stokes equations in dimension 2. The proof relies crucially on symmetry arguments, combined with a suitable pruning procedure to discard super exponential collision trees.
Wed, 02 Mar 2016
15:00

Cryptographic Algorithms Used in Trusted Platform Modules

Liqun Chen
(Hewlett Packard Labs)
Abstract

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.

Subscribe to