Learning stochastic differential equations using RNN with log signature features
Liao, S Lyons, T Yang, W Ni, H (22 Aug 2019)
Acceleration of Descent-based Optimization Algorithms via Carathéodory’s Theorem
Cosentino, F Oberhauser, H Abate, A (25 Nov 2020)
Generalised Recombination Interpolation Method (GRIM)
McLeod, A Lyons, T (16 May 2022)
The shifted ODE method for underdamped Langevin MCMC
Foster, J Lyons, T Oberhauser, H (10 Jan 2021)
Nonlinear independent component analysis for discrete-time and continuous-time signals
Schell, A Oberhauser, H (04 Feb 2021)
Fri, 20 Jan 2023

16:00 - 17:00
L1

Prime numbers: Techniques, results and questions

James Maynard
(Oxford University )
Abstract

The basic question in prime number theory is to try to understand the number of primes in some interesting set of integers. Unfortunately many of the most basic and natural examples are famous open problems which are over 100 years old!

We aim to give an accessible survey of (a selection of) the main results and techniques in prime number theory. In particular we highlight progress on some of these famous problems, as well as a selection of our favourite problems for future progress.

Acceleration of Descent-based Optimization Algorithms via Carathéodory’s Theorem
Cosentino, F OBERHAUSER, H Abate, A (25 Nov 2020)
Subscribe to