ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥3d\geq 3 be the maximum degree, let ℓ\ell be the activity, and let ℓc(d)=(d−1)d−1/(d−2)d\ell_c(d)=(d-1)^{d-1}/(d-2)^d be the critical activity for decay of correlations on the infinite dd-regular tree. Consider the weighted sum of independent sets, with each independent set II having weight ℓ∣I∣\ell^{|I|}. Computational hardness threshold conjecture. For every d>3d>3 and all ℓ>ℓc(d)\ell>\ell_c(d), unless RP=NPRP=NP, there does not exist a fully polynomial approximation scheme for counting weighted independent sets in graphs of maximum degree dd with activity ℓ\ell. This conjecture identifies the computational threshold with the uniqueness threshold; below ℓc(d)\ell_c(d) a fully polynomial approximation scheme is known, while hardness above the threshold remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.