Speaker: Dr Aleksander Horawa (North Wing)
Title: Bitcoin, elliptic curves, and this building

Abstract:
We will discuss two motivations to work on Algebraic Number Theory: applications to cryptography, and fame and fortune. For the first, we will explain how Bitcoin and other companies use Elliptic Curves to digitally sign messages. For the latter, we will introduce two famous problems in Number Theory: Fermat's Last Theorem, worth a name on this building, and the Birch Swinnerton--Dyer conjecture, worth $1,000,000 according to some people in this building (Clay Mathematics Institute).
 

Speaker: Dr Jemima Tabeart (South Wing)
Title: Numerical linear algebra for weather forecasting

Abstract:
The quality of a weather forecast is strongly determined by the accuracy of the initial condition. Data assimilation methods allow us to combine prior forecast information with new measurements in order to obtain the best estimate of the true initial condition. However, many of these approaches require the solution an enormous least-squares problem. In this talk I will discuss some mathematical and computational challenges associated with data assimilation for numerical weather prediction, and show how structure-exploiting numerical linear algebra approaches can lead to theoretical and computational improvements.

This session will introduce the opportunities for entrepreneurship and generating commercial impact available to researchers and students across MPLS. Representatives from the Maths Institute and across the university will discuss training and resources to help you begin enterprising and develop your ideas. We will hear from Paul Gass and Dawn Gordon about the support that can be provided by Oxford University Innovation, discussing commercialisation of research findings, consultancy, utilising your expertise and the protection and licensing of Intellectual Property. 

Please see below slides from the talk:

20230217 Short Seminar - Maths Fri@4_FINAL- Dept (1)_0.pdf

Introductory talk Maths 2023.pdf

Leadership and Innovation Presentation.pdf

I will discuss a line of work on estimating causal effects from observational data. In the first part of the talk, I will discuss identification and estimation of causal effects when the underlying causal graph is known, using adjustment. In the second part, I will discuss what one can do when the causal graph is unknown. Throughout, examples will be used to illustrate the concepts and no background in causality is assumed.

In this session, we will hold a panel discussion on how to best give an academic talk. Among other topics, we will focus on techniques for engaging your audience, for determining the level and technical details of the talk, and for giving both blackboard and slide presentations. The discussion will begin with a directed panel discussion before opening up to questions from the audience.

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.

The Dedekind zeta function generalises the Riemann zeta
function to other number fields than the rationals. The analytic class number
formula says that the leading term of the Dedekind zeta function is a
product of invariants of the number field. I will say some things
about the class number formula, about L-functions, and about Stark's
conjecture which generalises the class number formula.

A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ where every vertex has its in- and outdegree both equal to $n$. In 1981, Jackson conjectured that any regular bipartite tournament can be decomposed into Hamilton cycles. We prove this conjecture for sufficiently large $n$. Along the way, we also prove several further results, including a conjecture of Liebenau and Pehova on Hamilton decompositions of dense bipartite digraphs.

Let $p \ge 3$ be a prime integer. The density of a non-empty solution set of a system of affine equations $L_i(x) = b_i$, $i=1,\dots,k$ on a vector space over the field $\mathbb{F}_p$ is determined by the dimension of the linear subspace $\langle L_1,\dots,L_k \rangle$, and tends to $0$ with the dimension of that subspace. In particular, if the solution set is dense, then the system of equations contains at most boundedly many pairwise distinct linear forms. In the more general setting of systems of affine conditions $L_i(x) \in E_i$ for some strict subsets $E_i$ of $\mathbb{F}_p$ and where the solution set and its density are taken inside $S^n$ for some non-empty subset $S$ of $\mathbb{F}_p$ (such as $\{0,1\}$), we can however usually find subsets of $S^n$ with density at least $1/2$ but such that the linear subspace $\langle L_1,\dots,L_k \rangle$ has arbitrarily high dimension. We shall nonetheless establish an approximate boundedness result: if the solution set of a system of affine conditions is dense, then it contains the solution set of a system of boundedly many affine conditions and which has approximately the same density as the original solution set. Using a recent generalisation by Gowers and the speaker of a result of Green and Tao on the equidistribution of high-rank polynomials on finite prime fields we shall furthermore prove a weaker analogous result for polynomials of small degree.

Based on joint work with Timothy Gowers (College de France and University of Cambridge).