On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász Local Lemma

Authors:
Tomáš Kulich;Miroslava Kemeňová
Affiliations:
Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynská dolina, 84248 Bratislava, Slovak Republic;Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynská dolina, 84248 Bratislava, Slovak Republic
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 0

An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Using the incompressibility method to obtain local lemma results for Ramsey-type problems

Information Processing Letters
A constructive proof of the general lovász local lemma

Journal of the ACM (JACM)
An application of Lovász' local lemma‐A new lower bound for the van der Waerden number

Random Structures & Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Schweitzer [Inform. Process. Lett. 109 (2009) 229-232] described a connection between the incompressibility method and the Lovasz Local Lemma. The idea was illustrated on the problem of lower bounding van der Waerden numbers. However, his result using incompressibility is worse than that obtained by Local Lemma by a multiplicative factor of 4/e. In this paper we improve his method to give exactly the same result as the Lovasz Local Lemma.