Tue, 31 Oct 2017

16:00 - 17:00
L5

Notions of difference closures of difference fields.

Zoe Chatzidakis
(CNRS and Ecole Normale Superieure)
Abstract


It is well known that the theory of differentially closed fields of characteristic 0 has prime models and that they are unique up to isomorphism. One can ask the same question for the theory ACFA of existentially closed difference fields (recall that a difference field is a field with an automorphism).

In this talk, I will first give the trivial reasons of why this question cannot have a positive answer. It could however be the case that over certain difference fields prime models (of the theory ACFA) exist and are unique. Such a prime model would be called a difference closure of the difference field K. I will show by an example that the obvious conditions on K do not suffice.

I will then consider the class of aleph-epsilon saturated models of ACFA, or of kappa-saturated models of ACFA. There are natural notions of aleph-epsilon prime model and kappa-prime model. It turns out that for these stronger notions, if K is an algebraically closed difference field of characteristic 0, with fixed subfield F aleph-epsilon saturated, then there is an aleph-epsilon prime model over K, and it is unique up to K-isomorphism. A similar result holds for kappa-prime when kappa is a regular cardinal.

None of this extends to positive characteristic.
 

Thu, 26 Oct 2017

16:00 - 17:00
L6

Joint Logic/ Number Theory Seminar: Virtual rigid motives of semi-algebraic sets in valued fields

Arthur Forey
(Institut de mathématiques de Jussieu)
Abstract

Let k be a field of characteristic zero and K=k((t)). Semi-algebraic sets over K are boolean combinations of algebraic sets and sets defined by valuative inequalities. The associated Grothendieck ring has been studied by Hrushovski and Kazhdan who link it via motivic integration to the Grothendieck ring of varieties over k. I will present a morphism from the former to the Grothendieck ring of motives of rigid analytic varieties over K in the sense of Ayoub. This allows to refine the comparison by Ayoub, Ivorra and Sebag between motivic Milnor fibre and motivic nearby cycle functor.
 

Tue, 10 Oct 2017

16:00 - 17:00
L5

Approximation, domination and integration

Boris Zilber
(Oxford)
Abstract

The talk will focus on results of two related strands of research undertaken by the speaker. The first is a model of quantum mechanics based on the idea of 'structural approximation'. The earlier paper 'The semantics of the canonical commutation relations' established a method of calculation, essentially integration, for quantum mechanics with quadratic Hamiltonians. Currently, we worked out a (model-theoretic) formalism for the method, which allows us to
perform more subtle calculations, in particular, we prove that our path integral calculation produce correct formula for quadratic Hamiltonians avoiding non-conventional limits used by physicists. Then we focus on the model-theoretic analysis of the notion of structural approximation and show that it can be seen as a positive model theory version of the theory of measurable structures, compact domination and integration (p-adic and adelic).

Thu, 02 Nov 2017

16:00 - 17:30
L3

Biological fluid dynamics at the microscale: nonlinearities in a linear world.

Lisa Fauci
(Tulane University, USA)
Abstract

Phytoplankton moving in the ocean, spermatozoa making their way  through the female reproductive tract and harmful bacteria that form biofilms on implanted medical devices interact with a surrounding fluid. Their length scales are small enough so that viscous effects dominate inertial effects allowing the resulting fluid dynamics to be described by the linear Stokes equations. However,  nonlinear behavior can occur because these structures are flexible and their form evolves with the flow. In addition, the fluid environment may also  be complex because of embedded microstructures that further complicate the dynamics.  We will discuss recent successes and challenges in describing these elastohydrodynamic systems.

Thu, 23 Nov 2017

16:00 - 16:30
L1

A Bio-inspired Design for a Switchable Elastocapillary Adhesive

Matthew Butler
(University of Oxford)
Abstract

Many species of insects adhere to vertical and inverted surfaces using footpads that secrete thin films of a mediating fluid. The fluid bridges the gap between the foot and the target surface. The precise role of this liquid is still subject to debate, but it is thought that the contribution of surface tension to the adhesive force may be significant. It is also known that the footpad is soft, suggesting that capillary forces might deform its surface. Inspired by these physical ingredients, we study a model problem in which a thin, deformable membrane under tension is adhered to a flat, rigid surface by a liquid droplet. We find that there can be multiple possible equilibrium states, with the number depending on the applied tension and aspect ratio of the system. The presence of elastic deformation  ignificantly enhances the adhesion force compared to a rigid footpad. A mathematical model shows that the equilibria of the system can be controlled via two key parameters depending on the imposed separation of the foot and target surface, and the tension applied to the membrane. We confirm this finding experimentally and show that the system may transition rapidly between two states as the two parameters are varied. This suggests that different strategies may be used to adhere strongly and then detach quickly.

Tue, 17 Oct 2017

14:00 - 14:30
L5

Multilevel weighted least squares polynomial approximation

Abdul-Lateef Haji-Ali
(University of Oxford)
Abstract

We propose and analyze a multilevel weighted least squares polynomial approximation method. Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method, which employs samples with different accuracies and is able to match the accuracy of single level approximations at reduced computational work. We prove complexity bounds under certain assumptions on polynomial approximability and sample work. Furthermore, we propose an adaptive
algorithm for situations where such assumptions cannot be verified a priori. Numerical experiments underline the practical applicability of our method.

Tue, 31 Oct 2017
14:15
L4

Multiplicity-free primitive ideals and W-algebras

Alexander Premet
(University of Manchester)
Abstract

In my talk I will explain how to relate 1-dimensional representations of finite W-algebras with multiplicity free primitive ideals of universal enveloping algebras and representations of minimal dimension of the corresponding reduced enveloping algebras (Humphreys' conjecture). I will also mention some open problems in the field.

Thu, 19 Oct 2017
16:00
L6

Smooth values of polynomials

Trevor Wooley
(University of Bristol)
Abstract

Recall that an integer n is called y-smooth when each of its prime divisors is less than or equal to y. It is conjectured that, for any a>0,  any polynomial of positive degree having integral coefficients should possess infinitely many values at integral arguments n that are n^a-smooth. One could consider this problem to be morally “dual” to the cognate problem of establishing that irreducible polynomials assume prime values infinitely often, unless local conditions preclude this possibility. This smooth values conjecture is known to be true in several different ways for linear polynomials, but in general remains unproven for any degree exceeding 1. We will describe some limited progress in the direction of the conjecture, highlighting along the way analogous conclusions for polynomial smoothness. Despite being motivated by a problem in analytic number theory, most of the methods make use of little more than pre-Galois theory. A guest appearance will be made by several hyperelliptic curves. [This talk is based on work joint with Jonathan Bober, Dan Fretwell and Greg Martin].

Fri, 03 Nov 2017

10:00 - 11:00
L3

Service optimisation and decision making in railway traffic management

Graham Scott
(Resonate)
Abstract

Railway traffic management is the combination of monitoring the progress of trains, forecasting of the likely future progression of trains, and evaluating the impact of intervention options in near real time in order to make traffic adjustments that minimise the combined delay of trains when measured against the planned timetable.

In a time of increasing demand for rail travel, the desire to maximise the usage of the available infrastructure capacity competes with the need for contingency space to allow traffic management when disruption occurs. Optimisation algorithms and decision support tools therefore need to be increasingly sophisticated and traffic management has become a crucial function in meeting the growing expectations of rail travellers for punctuality and quality of service.

Resonate is a technology company specialising in rail and connected transport solutions. We have embarked on a drive to maximise capacity and performance through the use of mathematical, statistical, data-driven and machine learning based methods driving decision support and automated traffic management solutions.

Subscribe to