Differences

This shows you the differences between two versions of the page.

--- sessions:2021sessions:2021session2 [2021/03/06 17:54] – [Talks] ross.kang
+++ sessions:2021sessions:2021session2 [2023/09/22 15:12] (current) – [Organisers] ross.kang
@@ Line 2: / Line 2: @@
 Lovász local lemma, entropy compression, stochastic local search algorithms, cluster expansion, hard-core model, exponentially many hypergraph colourings, and related topics/techniques.
+==== Organisers ====
+[[https://staff.fnwi.uva.nl/j.r.kang/|Ross Kang]] and [[https://lbgi.fr/~sereni/|Jean-Sébastien Sereni]]
 ==== Workshop dates ====
@@ Line 9: / Line 14: @@
 ==== Confirmed participants ====
-(updated 3 March, registration closed)
+{{ 2021_2_progress_report.png?nolink&500|}}
+(updated 8 March, registration closed)
   * [[ross.kang@gmail.com|Ross Kang]] (organiser)
@@ Line 36: / Line 43: @@
   * Xing Shi Cai
   * Wouter Cames van Batenburg
+  * David Harris
 *denotes speaker
@@ Line 51: / Line 59: @@
 Deadline: 5 March (closed).
-==== Schedule (tentative, all time European) ====
+==== Schedule (all times European) ====
 . Monday, 8 March
@@ Line 58: / Line 66: @@
 . Tuesday, 9 March
     a. Open working sessions
-    b. Progress reports (15:45)
+    b. Coffee break in wonder (15:15)
+    c. Progress reports (15:45)
 . Wednesday, 10 March
     a. Three talks (14:30 Bernshteyn, 15:30 Rosenfeld, 16:30 Davies)
@@ Line 64: / Line 73: @@
 . Thursday, 11 March
     a. Open working sessions
-    b. Progress reports (15:45)
+    b. Coffee break in wonder (15:15)
+    c. Progress reports (15:45)
 . Friday, 12 March
     a. Progress reports/Remaining open problems (15:00-16:30)
     b. Closing drinks
 . Sunday 14 March
-    a. Eat pie
+    a. Eat pie in wonder (20:00)
 For the open working sessions, we plan/suggest (based on the suggestion of Fiona Skerman) group contact moments once in the morning, once in the early afternoon, and optionally if needed once in the evening to coordinate across the Atlantic.
@@ Line 87: / Line 97: @@
 ===Anton Bernshteyn: Constructive versions of the Lovász Local Lemma===
 The breakthrough work of Moser and Tardos on the algorithmic Lovász Local Lemma has led to the emergence of a wide array of constructive versions of the LLL in a variety of different settings, ranging from computability theory to measure theory to distributed algorithms. In this talk, I will survey some of these developments.
-===Matthieu Rosenfeld: tbc===
+===Matthieu Rosenfeld: A simple counting argument===
-tbc
+Abstract: I will present a simple counting argument that was used by myself and by Wanless and Wood. This argument seems to provide slightly better bounds than entropy compression (for less work) in many cases. I will present two simple applications and try to clarify some connections between this argument and the LLL and entropy compression.
 ===Ewan Davies: The cluster expansion, Lovász local lemma and algorithms===
 The local lemma and its variants are such convenient statements that it is tempting to use them as a black box. We will shine a light into this box and survey deep connections between the cluster expansion from statistical physics, the local lemma, algorithms for finding objects guaranteed by the local lemma, and see how entropy compression emerges. The main goal of this talk is to act as a navigation aid for the extensive and diverse literature on these topics.
+==== Research results ====
+  * Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https://arxiv.org/abs/2106.15175
+  * Davies, Illingworth. The χ-Ramsey problem for triangle-free graphs. https://arxiv.org/abs/2107.12288
+  * Hurley, Pirot. A first moment proof of the Johansson-Molloy theorem. https://arxiv.org/abs/2109.15215
+  * Hurley, Pirot. Uniformly Random Colourings of Sparse Graphs. https://arxiv.org/abs/2303.15367