Abstract
Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction problems (CSPs) with large arities, using connections to the Lovász Local Lemma. Nevertheless, the boundaries of these methods for CSPs with non-Boolean domain are not well-understood. Our goal in this article is to fill in this gap and obtain strong inapproximability results by studying the prototypical problem in this class of CSPs, hypergraph colourings.
More precisely, we focus on the problem of approximately counting q-colourings on K-uniform hypergraphs with bounded degree Δ. An efficient algorithm exists if \({{\Delta \lesssim \frac{q^{K/3-1}}{4^KK^2}}}\) [Jain et al. 25; He et al. 23]. Somewhat surprisingly however, a hardness bound is not known even for the easier problem of finding colourings. For the counting problem, the situation is even less clear and there is no evidence of the right constant controlling the growth of the exponent in terms of K.
To this end, we first establish that for general q computational hardness for finding a colouring on simple/linear hypergraphs occurs at Δ ≳ KqK, almost matching the algorithm from the Lovász Local Lemma. Our second and main contribution is to obtain a far more refined bound for the counting problem that goes well beyond the hardness of finding a colouring and which we conjecture is asymptotically tight (up to constant factors). We show in particular that for all even q ≥ 4 it is NP-hard to approximate the number of colourings when Δ ≳ qK/2. Our approach is based on considering an auxiliary weighted binary CSP model on graphs, which is obtained by “halving” the K-ary hypergraph constraints. This allows us to utilise reduction techniques available for the graph case, which hinge upon understanding the behaviour of random regular bipartite graphs that serve as gadgets in the reduction. The major challenge in our setting is to analyse the induced matrix norm of the interaction matrix of the new CSP which captures the most likely solutions of the system. In contrast to previous analyses in the literature, the auxiliary CSP demonstrates both symmetry and asymmetry, making the analysis of the optimisation problem severely more complicated and demanding the combination of delicate perturbation arguments and careful asymptotic estimates.
- [1] . 2000. Some APX-completeness results for cubic graphs. Theoretical Computer Science 237, 1-2 (2000), 123–134.Google Scholar
Digital Library
- [2] . 1991. A parallel algorithmic version of the local lemma. Random Structures and Algorithms 2, 4 (1991), 367–378.Google Scholar
Digital Library
- [3] . 1991. An algorithmic approach to the Lovász local lemma. I. Random Structures and Algorithms 2, 4 (1991), 343–366.Google Scholar
Digital Library
- [4] . 2019. Approximation via correlation decay when strong spatial mixing fails. SIAM Journal on Computing 48, 2 (2019), 279–349.Google Scholar
Digital Library
- [5] . 2012. Inapproximability after uniqueness phase transition in two-spin systems. In Proceedings of the COCOA (Lecture Notes in Computer Science), Vol. 7402. Springer, 336–347.Google Scholar
Cross Ref
- [6] Zongchen Chen, Andreas Galanis, Daniel Stefankovic, and Eric Vigoda. 2022. Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, Joseph (Seffi) Naor and Niv Buchbinder (Eds.). SIAM, 2198–2207.
DOI: Google ScholarCross Ref
- [7] . 1996. Perfect matchings in random \(r\)-regular, \(s\)-uniform hypergraphs. Combinatorics, Probability and Computing 5, 1 (1996), 1–14.Google Scholar
Cross Ref
- [8] . 2001. On weighted vs unweighted versions of combinatorial optimization problems. Information and Computation 167, 1 (2001), 10–26.Google Scholar
Digital Library
- [9] . 2000. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Structures and Algorithms 17, 3-4 (2000), 213–237.Google Scholar
Digital Library
- [10] . 2020. On a simple hard variant of Not-All-Equal 3-SAT. Theoretical Computer Science 815 (2020), 147–152.Google Scholar
Digital Library
- [11] . 2002. On counting independent sets in sparse graphs. SIAM Journal on Computing 31, 5 (2002), 1527–1541.Google Scholar
Digital Library
- [12] . 1998. Uniquely colourable graphs and the hardness of colouring graphs of large girth. Combinatorics, Probability and Computing 7, 4 (1998), 375–386.Google Scholar
Digital Library
- [13] . 1975. Problems and results on 3-chromatic hypergraphs and some related questions. In Proceedings of the Infinite and Finite Sets (Colloq., Keszthely, 1973; Dedicated to P. Erdős on His 60th Birthday), Vol. II. 609–627.Google Scholar
- [14] . 2021. Fast sampling and counting \(k\)-SAT solutions in the local lemma regime. Journal of the ACM 68, 6 (2021),
1–42. Google ScholarDigital Library
- [15] Weiming Feng, Kun He, and Yitong Yin. 2021. Sampling constraint satisfaction solutions in the local lemma regime. In Proceeding of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. ACM, 1565–1578.
DOI: Google ScholarDigital Library
- [16] . 2013. Coloring simple hypergraphs. Journal of Combinatorial Theory B 103, 6 (2013), 767–794.Google Scholar
Digital Library
- [17] . 2016. The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs. Information and Computation 251 (2016), 36–66.Google Scholar
Digital Library
- [18] . 2015. Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region. Journal of the ACM 62, 6 (2015), 50.Google Scholar
Digital Library
- [19] . 2016. Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. Combinatorics, Probability and Computing 25, 4 (2016), 500–559.Google Scholar
Cross Ref
- [20] . 2016. The local lemma is asymptotically tight for SAT. Journal of the ACM 63, 5 (2016), 43:1–43:32.Google Scholar
Digital Library
- [21] . 2019. Uniform sampling through the Lovász local lemma. Journal of the ACM 66, 3 (2019), 18:1–18:31.Google Scholar
Digital Library
- [22] . 2019. Counting hypergraph colorings in the local lemma regime. SIAM Journal on Computing 48, 4 (2019), 1397–1424.Google Scholar
Digital Library
- [23] . 2021. Perfect sampling for (atomic) Lovász local lemma. arXiv:1701.00133. Retrieved from https://arxiv.org/abs/1701.00133.Google Scholar
- [24] . 2019. Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54, 4 (2019), 730–767.Google Scholar
Cross Ref
- [25] . 2021. On the sampling Lovász local lemma for atomic constraint satisfaction problems. arXiv:1701.00133. Retrieved from https://arxiv.org/abs/1701.00133.Google Scholar
- [26] . 2021. Towards the sampling Lovász local lemma. In Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science. IEEE, 173–183.
DOI: Google ScholarCross Ref
- [27] . 1986. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 (1986), 169–188.Google Scholar
Cross Ref
- [28] . 1997. On the hardness of approximating max \(k\)-cut and its dual. Chicago Journal of Theoretical Computer Science 1997 (1997).Google Scholar
- [29] . 1993. One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM Journal on Computing 22, 1 (1993), 203–210.Google Scholar
Digital Library
- [30] . 2013. Correlation decay up to uniqueness in spin systems. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 67–84.
Google Scholar Cross Ref
- [31] . 2007. Fast mixing for independent sets, colorings, and other models on trees. Random Structures and Algorithms 31, 2 (2007), 134–172.Google Scholar
Digital Library
- [32] . 2019. Approximate counting, the Lovász local lemma, and inference in graphical models. Journal of the ACM 66, 2 (2019), 10:1–10:25.Google Scholar
Digital Library
- [33] . 1998. Further algorithmic aspects of the local lemma. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, 524–529.Google Scholar
Digital Library
- [34] . 2009. A constructive proof of the Lovász local lemma. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing. ACM, 343–350.Google Scholar
Digital Library
- [35] . 2010. A constructive proof of the general Lovász local lemma. Journal of the ACM 57, 2 (2010), 11.Google Scholar
Digital Library
- [36] . 2009. On the hardness of sampling independent sets beyond the tree threshold. Probability Theory and Related Fields 143, 3-4 (2009), 401–439.Google Scholar
Cross Ref
- [37] . 2019. Satisfiability thresholds for regular occupation problems. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming.90:1–90:14.Google Scholar
- [38] . 2010. Computational transition at the uniqueness threshold. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 287–296.Google Scholar
Digital Library
- [39] . 2014. Counting in two-spin models on \(d\)-regular graphs. Annals of Probability 42, 6 (2014), 2383–2416.Google Scholar
Cross Ref
- [40] . 2008. Improved algorithmic versions of the Lovász local lemma. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 611–620.Google Scholar
Index Terms
Inapproximability of Counting Hypergraph Colourings
Recommendations
The Ramsey number for hypergraph cycles I
Let Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1.....,vn and edges v1v2v3, v3v4v5, v5v6v7,.....,vn-1vnv1. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices ...
A Complexity Trichotomy for Approximately Counting List H-Colorings
We examine the computational complexity of approximately counting the list H-colorings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a reflexive complete ...
Reconfiguration graph for vertex colourings of weakly chordal graphs
AbstractThe reconfiguration graph R k ( G ) of the k-colourings of a graph G contains as its vertex set the k-colourings of G and two colourings are joined by an edge if they differ in colour on just one vertex of G.
Bonamy et al. (...






Comments