Frobenius's unicity conjecture for Markoff numbers
Statement
Let be the graph whose vertices are the positive Markoff numbers, with edges arising from the Markoff transformations between coordinates of solutions to . Frobenius's unicity conjecture. The graph is a tree. The graph is known to be connected because every positive solution reduces to , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.