ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a dd-regular graph, let q≥d+1q\ge d+1, let β>0\beta>0, and let UGq(β)U^q_G(\beta) denote the objective associated with the Potts-model linear-programming relaxation. Davies–Jenssen–Perkins–Roberts minimisation conjecture. For d≥3d\ge 3, the minimisation program has optimum given by Kd,dK_{d,d}, and consequently

UKd,dq(β)≤UGq(β)U^q_{K_{d,d}}(\beta)\le U^q_G(\beta)

for every dd-regular graph GG. This is the minimisation part of the conjecture from Davies, Jenssen, Perkins and Roberts. The paper establishes the relevant case d=4d=4 and notes that the statement is open for d≥5d\ge 5.

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.