A Constructive Lovász Local Lemma for Permutations

While there has been significant progress on algorithmic aspects of the Lovász Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations. The breakthrough algorithm of Moser & Tardos only works in the setting of independent variables, and does not apply in this context. We resolve this by developing a randomized polynomial-time algorithm for such applications. A noteworthy application is for Latin transversals: the best general result known here (Bissacot et al., improving on Erdős and Spencer), states that any n×n matrix in which each entry appears at most (27/256)n times, has a Latin transversal. We present the first polynomialtime algorithm to construct such a transversal. We also develop RNC algorithms for Latin transversals, rainbow Hamiltonian cycles, strong chromatic number, and hypergraph packing. In addition to efficiently finding a configuration which avoids bad events, the algorithm of Moser & Tardos has many powerful extensions and properties. These include a well-characterized distribution on the output distribution, parallel algorithms, and a partial ∗An extended abstract of this paper has appeared in the Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms, 2014 [19]. †Research supported in part by NSF Awards CNS-1010789 and CCF-1422569. ‡Research supported in part by NSF Awards CNS-1010789 and CCF-1422569, and by a research award from Adobe, Inc. ACM Classification: F.2.2, G.3 AMS Classification: 68W20, 60C05, 05B15

[1]  Aldo Procacci,et al.  An Improvement of the Lovász Local Lemma via Cluster Expansion , 2009, Combinatorics, Probability and Computing.

[2]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[3]  Ron Aharoni,et al.  Independent systems of representatives in weighted graphs , 2007, Comb..

[4]  Yoshiharu Kohayakawa,et al.  Properly coloured copies and rainbow copies of large graphs with small maximum degree , 2010, Random Struct. Algorithms.

[5]  Michael R. Fellows.  Transversals of Vertex Partitions in Graphs , 1990, SIAM J. Discret. Math..

[6]  P. Erdös,et al.  Has every Latin square of order n a partial Latin transversal of size n -1? , 1988 .

[7]  Maria Axenovich,et al.  On the Strong Chromatic Number of Graphs , 2006, SIAM J. Discret. Math..

[8]  Gábor Tardos,et al.  A constructive proof of the general lovász local lemma , 2009, JACM.

[9]  Dimitris Achlioptas,et al.  Random Walks That Find Perfect Objects and the Lovasz Local Lemma , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[10]  Noga Alon,et al.  Covering with Latin Transversals , 1995, Discret. Appl. Math..

[11]  Linyuan Lu,et al.  Quest for Negative Dependency Graphs , 2012 .

[12]  Austin Tyler Mohr.  Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs , 2013 .

[13]  Jan Vondrák,et al.  An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[14]  Carsten Thomassen,et al.  Path and cycle sub-ramsey numbers and an edge-colouring conjecture , 1986, Discret. Math..

[15]  Paul Erdös,et al.  Lopsided Lovász Local Lemma and Latin transversals , 1991, Discret. Appl. Math..

[16]  Wesley Pegden.  An Extension of the Moser-Tardos Algorithmic Local Lemma , 2014, SIAM J. Discret. Math..

[17]  Aravind Srinivasan,et al.  A constructive algorithm for the Lovász Local Lemma on permutations , 2014, SODA.

[18]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[19]  Alan M. Frieze,et al.  On Rainbow Trees and Cycles , 2008, Electron. J. Comb..

[20]  Penny E. Haxell.  On the Strong Chromatic Number , 2004, Comb. Probab. Comput..

[21]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[22]  A. Scott,et al.  The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma , 2003, cond-mat/0309352.

[23]  Penny E. Haxell.  An improved bound for the strong chromatic number , 2008, J. Graph Theory.

[24]  Aravind Srinivasan,et al.  New Constructive Aspects of the Lovasz Local Lemma , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[25]  Mario Szegedy,et al.  Moser and tardos meet Lovász , 2011, STOC '11.