BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20200213T144338Z
DTSTART:20200214T150000Z
DTEND:20200214T160000Z
SUMMARY: Jonathan Chapman - Arithmetic Colouring Problems
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}tjj-k6kusit
x-j8lnm7
DESCRIPTION:This week's pure postgrad seminar will be given by Jonathan
Chapman at 3pm in Frank Adams 1.\n\nAbstract:\nAn equation is called par
tition regular over a set S if every finite colouring of S produces a so
lution to the equation whose entries all have the same colour. The study
of partition regularity has become a central question of arithmetic com
binatorics and has established links with areas such as dynamics\, numbe
r theory\, harmonic analysis\, and model theory. In this talk I will giv
e an overview of the classical results and discuss some recent breakthro
ughs concerning non-linear problems.
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams 1\, Alan Turing Building\, Manchester
END:VEVENT
END:VCALENDAR