Using the incompressibility method to obtain local lemma results for Ramsey-type problems

We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated on the example of van der Waerden numbers. In particular we reprove that w(k;c)>=c^k^-^3k@?k-1k. The method is applicable to obtain lower bounds of Ramsey numbers, large transitive subtournaments and other Ramsey phenomena as well.

[1]  E.R. Berlekamp.  A Construction for Partitions Which Avoid Long Arithmetic Progressions , 1968, Canadian Mathematical Bulletin.

[2]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[3]  Zoltán Szabó.  An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number , 1990, Random Struct. Algorithms.

[4]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[5]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6]  Aaron Robertson,et al.  Ramsey Theory on the Integers , 2014 .