Implementations and the independent set polynomial below the Shearer threshold

The independent set polynomial is important in many areas of combinatorics, computer science, and statistical physics. For every integer Δ≥2, the Shearer threshold is the value λ⁎(Δ)=(Δ−1)Δ−1/ΔΔ. It is known that for λ<−λ⁎(Δ), there are graphs G with maximum degree Δ whose independent set polynomial, evaluated at λ, is at most 0. Also, there are no such graphs for any λ>−λ⁎(Δ). This paper is motivated by the computational problem of approximating the independent set polynomial when λ<−λ⁎(Δ). The key issue in complexity bounds for this problem is “implementation”. Informally, an implementation of a real number λ′ is a graph whose hard-core partition function, evaluated at λ, simulates a vertex-weight of λ′ in the sense that λ′ is the ratio between the contribution to the partition function from independent sets containing a certain vertex and the contribution from independent sets that do not contain that vertex. Implementations are the cornerstone of intractability results for the problem of approximately evaluating the independent set polynomial. Our main result is that, for any λ<−λ⁎(Δ), it is possible to implement a set of values that is dense over the reals. The result is tight in the sense that it is not possible to implement a set of values that is dense over the reals for any λ>λ⁎(Δ). Our result has already been used in a paper with Bezáková (STOC 2018) to show that it is #P-hard to approximate the evaluation of the independent set polynomial on graphs of degree at most Δ at any value λ<−λ⁎(Δ). In the appendix, we give an additional incomparable inapproximability result (strengthening the inapproximability bound to an exponential factor, but weakening the hardness to NP-hardness).