16:30
Partition regularity of $x+y=z^2$ over $\mathbb{Z}/p\mathbb{Z}$
Abstract
Consider the following question. Given a $k$-colouring of the positive integers, must there exist a solution to $x+y=z^2$ with $x,y,z$ all the same colour (and not all equal to 2)? Using $10$ colours a counterexample can be given to show that the answer is "no". If one instead asks the same question over $\mathbb{Z}/p\mathbb{Z}$ for some prime $p$, the answer turns out to be "yes", provided $p$ is large enough in terms of the number of colours used. I will talk about how to prove this using techniques developed by Ben Green and Tom Sanders. The main ingredients are a regularity lemma, a counting lemma and a Ramsey lemma.
16:30
16:30
Linear (in)equalities in primes
Abstract
Many theorems and conjectures in prime number theory are equivalent to finding solutions to certain linear equations in primes -- witness Goldbach's conjecture, the twin prime conjecture, Vinogradov's theorem, finding k-term arithmetic progressions, etcetera. Classically these problems were attacked using Fourier analysis -- the 'circle' method -- which yielded some success, provided that the number of variables was sufficiently large. More recently, a long research programme of Ben Green and Terence Tao introduced two deep and wide-ranging techniques -- so-called 'higher order Fourier analysis' and the 'transference principle' -- which reduces the number of required variables dramatically. In particular, these methods give an asymptotic formula for the number of k-term arithmetic progressions of primes up to X. In this talk we will give a brief survey of these techniques, and describe new work of the speaker, partially ongoing, which applies the Green-Tao machinery to count prime solutions to certain linear inequalities in primes -- a 'higher order Davenport-Heilbronn method'.
16:30
Iterating the algebraic étale-Brauer obstruction
Abstract
A question by Poonen asks whether iterating the étale-Brauer set can give a finer obstruction set. We tackle the algebraic version of Poonen's question and give, in many cases, a negative answer.
17:30
Compactifying subanalytic families of holomorphic functions and a uniform parametrization theorem
Fault prediction from time series data
Abstract
On the railway network, for example, there is a large base of installed equipment with a useful life of many years. This equipment has condition monitoring that can flag a fault when a measured parameter goes outside the permitted range. If we can use existing measurements to predict when this would occur, preventative maintenance could be targeted more effectively and faults reduced. As an example, we will consider the current supplied to a points motor as a function of time in each operational cycle.