BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability seminar
SUMMARY:Nonlinear problems in arithmetic Ramsey theory - S
ean Prendiville (Lancaster University)
DTSTART:20191121T140000Z
DTEND:20191121T150000Z
UID:TALK3944AT
URL:/talk/index/3944
DESCRIPTION:Rado characterised those systems of linear Diophan
tine equations which are ‘unbreakable' with respec
t to finite partitions\, so that any partition of
the positive integers yields a set containing a so
lution. Similarly\, a celebrated theorem of Szemer
édi gives rise to a characterisation of linear sys
tems possessing solutions in any ‘dense' set of in
tegers. We discuss variants of these results for c
ertain nonlinear equations/configurations.
LOCATION:Watson LTB
CONTACT:Eoin Long
END:VEVENT
END:VCALENDAR