Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Inapproximability of Counting Hypergraph Colourings

Inapproximability of Counting Hypergraph Colourings 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computation Theory (TOCT) Association for Computing Machinery

Inapproximability of Counting Hypergraph Colourings

Download PDF
33 pages

Loading next page...
 
/lp/association-for-computing-machinery/inapproximability-of-counting-hypergraph-colourings-fgK8aDPD1Q
Publisher
Association for Computing Machinery
Copyright
Copyright © 2022 Copyright held by the owner/author(s). Publication rights licensed to ACM.
ISSN
1942-3454
eISSN
1942-3462
DOI
10.1145/3558554
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Computation Theory (TOCT) – Association for Computing Machinery

Published: Feb 1, 2023

Keywords: Approximate counting

References

  • Some APX-completeness results for cubic graphs
    [,
  • A parallel algorithmic version of the local lemma
    [,
  • An algorithmic approach to the Lovász local lemma
    [,
  • Approximation via correlation decay when strong spatial mixing fails
    [,
  • Inapproximability after uniqueness phase transition in two-spin systems
    [,
  • Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region
    [,
  • Perfect matchings in random \(r\) -regular, \(s\) -uniform hypergraphs
    [,
  • On weighted vs unweighted versions of combinatorial optimization problems
    [,
  • Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
    [,
  • On a simple hard variant of Not-All-Equal 3-SAT
    [,
  • On counting independent sets in sparse graphs
    [,
  • Uniquely colourable graphs and the hardness of colouring graphs of large girth
    [,
  • Problems and results on 3-chromatic hypergraphs and some related questions
    [,
  • Fast sampling and counting \(k\) -SAT solutions in the local lemma regime
    [,
  • Sampling constraint satisfaction solutions in the local lemma regime
    [,
  • Coloring simple hypergraphs
    [,
  • The complexity of approximately counting in 2-spin systems on \(k\) -uniform bounded-degree hypergraphs
    [,
  • Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
    [,
  • Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
    [,
  • The local lemma is asymptotically tight for SAT
    [,
  • Uniform sampling through the Lovász local lemma
    [,
  • Counting hypergraph colorings in the local lemma regime
    [,
  • Perfect sampling for (atomic) Lovász local lemma
    [,
  • Rapid mixing of hypergraph independent sets
    [,
  • On the sampling Lovász local lemma for atomic constraint satisfaction problems
    [,
  • Towards the sampling Lovász local lemma
    [,
  • Random generation of combinatorial structures from a uniform distribution
    [,
  • On the hardness of approximating max \(k\) -cut and its dual
    [,
  • One more occurrence of variables makes satisfiability jump from trivial to NP-complete
    [,
  • Correlation decay up to uniqueness in spin systems
    [,
  • Fast mixing for independent sets, colorings, and other models on trees
    [,
  • Approximate counting, the Lovász local lemma, and inference in graphical models
    [,
  • Further algorithmic aspects of the local lemma
    [,
  • A constructive proof of the Lovász local lemma
    [,
  • A constructive proof of the general Lovász local lemma
    [,
  • On the hardness of sampling independent sets beyond the tree threshold
    [,
  • Satisfiability thresholds for regular occupation problems
    [,
  • Computational transition at the uniqueness threshold
    [,
  • Counting in two-spin models on \(d\) -regular graphs
    [,
  • Improved algorithmic versions of the Lovász local lemma
    [,