BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Borel Local Lemma - Oleg Pikhurko (University of Warwick)
DTSTART:20180215T143000Z
DTEND:20180215T153000Z
UID:TALK96859@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:The Lovász Local Lemma is a powerful tool for finding combina
 torial objects with given local constraints. We present a Borel version of
  the local lemma\, i.e. we show that\, under suitable assumptions\, if the
  set of variables in the local lemma has a structure of a Borel space\, th
 en there exists a satisfying assignment which is a Borel function.\nThe ma
 in tool which we develop for the proof\, which is of independent interest\
 , is a parallel version of the Moser-Tardos algorithm which uses the same 
 random bits to resample clauses that are far enough in the dependency grap
 h.\n\nThis is joint work with Endre Csóka\, Łukasz Grabowski\, András M
 áthé and Konstantinos Tyros.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR