Wed, 06 Feb 2019
11:00
N3.12

RSK Insertion and Symmetric Polynomials

Adam Keilthy
(University of Oxford)
Abstract

Young diagrams frequently appear in the study of partitions and representations of the symmetric group. By filling these diagrams with numbers, we obtain Young tableau, combinatorial objects onto which we can define the structure of a monoid via insertion algorithms. We will explore this structure and it's connection to a basis of the ring of symmetric polynomials. If we have time, we will mention alternative monoid structures and their corresponding bases.

Wed, 29 May 2019

18:00 - 19:00
L1

Marcus du Sautoy - The Creativity Code: How AI is learning to write, paint and think

Marcus du Sautoy
(University of Oxford)
Further Information

Oxford Mathematics Public Lectures together with the Simonyi Science Show:

Will a computer ever compose a symphony, write a prize-winning novel, or paint a masterpiece? And if so, would we be able to tell the difference?

In The Creativity Code, Marcus du Sautoy examines the nature of creativity, as well as providing an essential guide into how algorithms work, and the mathematical rules underpinning them. He asks how much of our emotional response to art is a product of our brains reacting to pattern and structure. And might machines one day jolt us in to being more imaginative ourselves?

Marcus du Sautoy is Simonyi Professor for the Public Understanding of Science in Oxford.

6-7pm
Mathematical Institute
Oxford

Please email @email to register.

Watch live:
https://facebook.com/OxfordMathematics
https://livestream.com/oxuni/du-Sautoy2

The Oxford Mathematics Public Lectures are generously supported by XTX Markets.

Fri, 08 Feb 2019

12:00 - 13:00
L4

Leveraging the Signature for Landmark-based Human Action Recognition

Weixin Yang
(University of Oxford)
Abstract

Landmark-based human action recognition in videos is a challenging task in computer vision. One crucial step is to design discriminative features for spatial structure and temporal dynamics. To this end, we use and refine the path signature as an expressive, robust, nonlinear, and interpretable representation for landmark-based streamed data. Instead of extracting signature features from raw sequences, we propose path disintegrations and transformations as preprocessing to improve the efficiency and effectiveness of signature features. The path disintegrations spatially localize a pose into a collection of m-node paths from which the signatures encode non-local and non-linear geometrical dependencies, while temporally transform the evolutions of spatial features into hierarchical spatio-temporal paths from which the signatures encode long short-term dynamical dependencies. The path transformations allow the signatures to further explore correlations among different informative clues. Finally, all features are concatenated to constitute the input vector of a linear fully-connected network for action recognition. Experimental results on four benchmark datasets demonstrated that the proposed feature sets with only linear network achieves comparable state-of-the-art result to the cutting-edge deep learning methods. 

Mon, 14 Jan 2019

15:45 - 16:45
L3

Nonparametric pricing and hedging with signatures

IMANOL PEREZ
(University of Oxford)
Abstract

We address the problem of pricing and hedging general exotic derivatives. We study this problem in the scenario when one has access to limited price data of other exotic derivatives. In this presentation I explore a nonparametric approach to pricing exotic payoffs using market prices of other exotic derivatives using signatures.

 

Mon, 11 Mar 2019

17:00 - 18:00
L1

Marc Lackenby - Knotty Problems

Marc Lackenby
(University of Oxford)
Further Information

Knots are a familiar part of everyday life, for example tying your tie or doing up your shoe laces. They play a role in numerous physical and biological phenomena, such as the untangling of DNA when it replicates. However, knot theory is also a well-developed branch of pure mathematics.

In his talk, Marc will give an introduction to this theory and will place it in the context of the modern field of topology. This is the branch of mathematics where you are allowed to stretch and deform objects, but not tear them. He will explain how topological techniques can be used to prove some surprising facts about knots. He will also give some problems about knots that mathematicians haven't yet been able to solve.

Marc Lackenby is a Professor of Mathematics in Oxford and a Fellow of St Catherine's College.

5.00pm-6.00pm, Mathematical Institute, Oxford

Please email @email to register.

Watch live:

https://www.facebook.com/OxfordMathematics
https://livestream.com/oxuni/lackenby

The Oxford Mathematics Public Lectures are generously supported by XTX Markets.

Thu, 31 Jan 2019
12:00
L4

Path-by-path well-posedness of stochastic nonlinear diffusion equations

Benjamin Fehrman
(University of Oxford)
Abstract

In this talk, which is based on joint work with Benjamin Gess, I will describe a pathwise well-posedness theory for stochastic porous media and fast diffusion equations driven by nonlinear, conservative noise. Such equations arise in the theory of mean field games, as an approximation to the Dean–Kawasaki equation in fluctuating hydrodynamics, to describe the fluctuating hydrodynamics of a zero range process, and as a model for the evolution of a thin film in the regime of negligible surface tension.  Our methods are motivated by the theory of stochastic viscosity solutions, which are applied after passing to the equation’s kinetic formulation, for which the noise enters linearly and can be inverted using the theory of rough paths.  I will also mention the application of these methods to nonlinear diffusion equations with linear, multiplicative noise.

Wed, 28 Nov 2018
11:00
N3.12

"The dark side of the Force is a pathway to many abilities some consider to be unnatural." — Chancellor Palpatine

Alex Luc Chevalier
(University of Oxford)
Abstract

We will talk about set theory, and, more specifically, forcing. Forcing is powerful. It is the go-to method for proving the independence of the continuum hypothesis or for understanding the (lack of) fine structure of the real numbers. However, forcing is hard. Keen to export their theorems to more mainstream areas of mathematics, set theorists have tackled this issue by inventing forcing axioms, (relatively) simple mathematical statements which describe sophisticated forcing extensions. In my talk, I will present the basics of forcing, I will introduce some interesting forcing axioms and I will show how these might be used to obtain surprising independence results.

Wed, 21 Nov 2018
11:00
N3.12

The Monoidal Marriage of Stucture and Physics

Nicola Pinzani
(University of Oxford)
Abstract

What does abstract nonsense (category theory) have to do with the apparently opposite proverbial concreteness of physics? In this talk I will try to convey the importance of understanding physical theories from a compositional and structural perspective, where the fundamental logic of interaction between systems becomes the real protagonist. Firstly, we will see how different classes of symmetric monoidal categories can be used to model physical processes in a very natural and intuitive way. We will then explore the claim that category theory is not only useful in providing a unified framework, but it can be also used to perfect and modify preexistent models. In this direction, I will show how the introduction of a trace in the symmetric monoidal category describing QIT can be used to talk about quantum interactions induced by cyclic causal relationships.

Wed, 14 Nov 2018
11:00
N3.12

Nets of lines in the projective plane

Sebastian Eterović
(University of Oxford)
Abstract

Nets of lines are line arrangements satisfying very strict intersection conditions. We will see that nets can be defined in a very natural way in algebraic geometry, and, thanks to the strict intersection properties they satisfy, we will see that a lot can be said about classifying them over the complex numbers. Despite this, there are still basic unanswered questions about nets, which we will discuss. 
 

Subscribe to University of Oxford