Unicity conjecture for the generalized Markov values m(c(n,d))

At least 5 years old · documented by

Let c(n,d)c(n,d) be the path associated with (n,d)(n,d) in the generalized Markov construction, and let m(c(n,d))m(c(n,d)) denote its associated value. Unicity conjecture. If

n≤d,n′≤d′,m(c(n,d))=m(c(n′,d′)),n\leq d,\qquad n'\leq d',\qquad m(c(n,d))=m(c(n',d')),

then

n=n′andd=d′.n=n'\quad\text{and}\quad d=d'.

Thus, within the region n≤dn\leq d, the values m(c(n,d))m(c(n,d)) should determine the pair (n,d)(n,d) uniquely. The source presents this as a stronger conjecture motivated by the observed repetitions and does not provide a resolution in the supplied text.

References

Primary source

Clément Lagisquet, Edita Pelantová, Sébastien Tavenas and Laurent Vuillon, “On the Markov numbers: fixed numerator, denominator, and sum conjectures”, arXiv:2010.10335 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.