ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Δ\Delta be an integer with Δ≥3\Delta \ge 3 and let β∈CA\beta\in \mathbb{C}_{\mathbb{A}} with β∉R∪{i,−i}\beta \not \in \mathbb{R}\cup \{i, -i\}. Let GG be a graph with maximum degree at most Δ\Delta, and let ZIsing(G;β)Z_{\mathrm{Ising}}(G; \beta) denote its Ising partition function. The approximation problems \textscIsingNorm(β,Δ,1.01)\textsc{IsingNorm}(\beta, \Delta, 1.01) and \textscIsingArg(β,Δ,π/3)\textsc{IsingArg}(\beta, \Delta, \pi/3) concern, respectively, approximating the norm and argument of this partition function. Hardness conjecture from zeros. If there is a graph GG with maximum degree at most Δ\Delta such that

ZIsing(G;β)=0,Z_{\mathrm{Ising}}(G; \beta) = 0,

then the problems

\textscIsingNorm(β,Δ,1.01)and\textscIsingArg(β,Δ,π/3)\textsc{IsingNorm}(\beta, \Delta, 1.01) \quad\text{and}\quad \textsc{IsingArg}(\beta, \Delta, \pi/3)

are #P\mathrm{\#P}-hard. The surrounding discussion explains that a zero of the partition function can typically be used to implement the edge interaction −1-1, which yields hardness through the preceding lemma; the conjecture concerns the case where terminal-degree conditions are not established.

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.