ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an inner triangulation of a 55-gon, and let FF be an initial five color forest of GG. The algorithm described above produces iterates for these data.

Termination conjecture. The algorithm terminates with a non-negative solution for every graph GG which is an inner triangulation of a 55-gon, and for every initial five color forest FF of GG.

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 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.