Davies–Jenssen–Perkins–Roberts minimisation conjecture for the Potts-model program
Statement
Let be a -regular graph, let , let , and let denote the objective associated with the Potts-model linear-programming relaxation. Davies–Jenssen–Perkins–Roberts minimisation conjecture. For , the minimisation program has optimum given by , and consequently
for every -regular graph . This is the minimisation part of the conjecture from Davies, Jenssen, Perkins and Roberts. The paper establishes the relevant case and notes that the statement is open for .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.