BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Trinity Mathematical Society
SUMMARY:Finitary and Infinitary Mathematics\, Regularity a
nd the Crossover Between Combinatorics and Analysi
s - Freddie Manners (DPMMS)
DTSTART;TZID=Europe/London:20130224T114500
DTEND;TZID=Europe/London:20130224T121500
UID:TALK43506AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/43506
DESCRIPTION:Szemeredi's regularity lemma is a powerful tool in
combinatorics\, and has been described as a "stru
cture theorem for graphs". Both the statement and
the proof can seem rather unenlightening -- unles
s you see the analogy with some very well-known re
sults in analysis and probability. More precisely
\, regularity is what you get when you take the pr
oofs of these results and accidentally try to run
them in a finite world.\n\nI'll try to present thi
s picture while finding time to say what regularit
y is good for\, and maybe touch on the machinery o
f compactness and ultrafilters that does all this
stuff for you.\n
LOCATION:Winstanley Lecture Theatre\, Trinity College
CONTACT:Mary Fortune
END:VEVENT
END:VCALENDAR