Termination conjecture for the pentagon contact representation algorithm
Statement
Let be an inner triangulation of a -gon, and let be an initial five color forest of . The algorithm described above produces iterates for these data.
Termination conjecture. The algorithm terminates with a non-negative solution for every graph which is an inner triangulation of a -gon, and for every initial five color forest of .
The conjecture asserts termination and success of the algorithm for all admissible inputs. The paper reports that two independent implementations and experiments have always been successful, but the authors cannot prove that the iterations make progress and note that the algorithm might otherwise cycle forever.
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.