ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T\mathbb T be the tree constructed from positive integer solutions of the paper's Diophantine equation, and let (x,y,z)(x,y,z) be a positive integer solution of that equation. The maximal number of a solution is the largest of its three coordinates. Uniqueness conjecture for the associated tree. Every number appearing in the tree T\mathbb T appears exactly once as the maximal number of some positive integer solution to the Diophantine equation. The statement is presented as a conjecture parallel to Markov's uniqueness conjecture; the supplied text does not establish its status, so it is recorded as open.

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.