ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GMG_M be the graph whose vertices are the positive Markoff numbers, with edges arising from the Markoff transformations between coordinates of solutions to x2+y2+z2=3xyzx^2+y^2+z^2=3xyz. Frobenius's unicity conjecture. The graph GMG_M is a tree. The graph is known to be connected because every positive solution reduces to (1,1,1)(1,1,1), but the absence of cycles remains intractable; partial results are known.

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.