BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Finitary and Infinitary Mathematics\, Regularity and the Crossover
  Between Combinatorics and Analysis - Freddie Manners (DPMMS)
DTSTART:20130224T114500Z
DTEND:20130224T121500Z
UID:TALK43506@talks.cam.ac.uk
CONTACT:Mary Fortune
DESCRIPTION:Szemeredi's regularity lemma is a powerful tool in combinatori
 cs\, and has been described as a "structure theorem for graphs".  Both the
  statement and the proof can seem rather unenlightening -- unless you see 
 the analogy with some very well-known results in analysis and probability.
   More precisely\, regularity is what you get when you take the proofs of 
 these results and accidentally try to run them in a finite world.\n\nI'll 
 try to present this picture while finding time to say what regularity is g
 ood for\, and maybe touch on the machinery of compactness and ultrafilters
  that does all this stuff for you.\n
LOCATION:Winstanley Lecture Theatre\, Trinity College
END:VEVENT
END:VCALENDAR