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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

â„č Information

Borel Local Lemma

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hybrid: in-person in Cambridge & online via Teams MAB Boulind Rooms 6&7 Mary Allan Building, Homerton College, Hills Road, Cambridge CB2 8PQ Neuroscience

Other talks

"Gods, Monsters & Middle-class Uncles: Indian Comics in a Time between Worlds" Title to be confirmed "That's History. That's Truth. I Seen It Myself": T'tc~tsa (Wailaki) and the Enslavement of California Native Americans. Carrollian momenta from anti de Sitter Talk TBC Dinner
 

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