University of Cambridge > Talks.cam > Combinatorics Seminar > Borel Local Lemma

Borel Local Lemma

Add to your list(s) Download to your calendar using vCal

  • UserOleg Pikhurko (University of Warwick)
  • ClockThursday 15 February 2018, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

The Lovász Local Lemma is a powerful tool for finding combinatorial 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, then there exists a satisfying assignment which is a Borel function. The main 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 graph.

This is joint work with Endre Csóka, Łukasz Grabowski, András Máthé and Konstantinos Tyros.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity