Jonathan Chapman - Arithmetic Colouring Problems
|Starts:||15:00 14 Feb 2020|
|Ends:||16:00 14 Feb 2020|
|What is it:||Seminar|
|Organiser:||Department of Mathematics|
|Who is it for:||Current University students|
This week's pure postgrad seminar will be given by Jonathan Chapman at 3pm in Frank Adams 1.
An equation is called partition regular over a set S if every finite colouring of S produces a solution to the equation whose entries all have the same colour. The study of partition regularity has become a central question of arithmetic combinatorics and has established links with areas such as dynamics, number theory, harmonic analysis, and model theory. In this talk I will give an overview of the classical results and discuss some recent breakthroughs concerning non-linear problems.
Travel and Contact Information
Frank Adams 1
Alan Turing Building