COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Combinatorics Seminar > A measurable version of the Lovász Local Lemma

## A measurable version of the Lovász Local LemmaAdd to your list(s) Download to your calendar using vCal - Gábor Kun (ELTE, Budapest)
- Thursday 24 January 2013, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. I shall prove a measurable version of the LLL that will allow to prove theorems of the following kind. Let $G$ be a compact group with a Borel probability
measure, and let $S_1, \dots , S_n$ be $k$-element subsets of $G$, where $\frac{2 e n k The measurable LLL requires the same local conditions as the discrete LLL : it gives a measurable colouring (evaluation), but an unfortunate error of measure $\varepsilon$ might occur. I shall apply this measurable LLL to give another solution to the dynamical von Neumann problem of Gaboriau and Lyons. This proof is based on the ideas of the proof of the algorithmic LLL due to Moser and Tardos. This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsCambridge Network Sales & Marketing SIG Bennett Institute for Public Policy The Faraday Institute for Science and Religion## Other talksThe world is not flat: towards 3D cell biology and 3D devices Effective Conference Presentations and Networking Around the world in 605 State energy agreements Polish Britain: Multilingualism and Diaspora Community Current-Induced Stresses in Ceramic Lithium-Ion Conductors Putting Feminist New Materialism to work through affective methodologies in early childhood research |