Markov Uniqueness Conjecture
For every , there is at most one pair satisfying and . Equivalently, if two positive-integer solutions of have the same largest coordinate , then their two smaller coordinates agree up to exchange.
References
- A Computational Verification of the Markov Uniqueness Conjecture for z10^500000 — arXiv — Hu Tan, Ying Zhang
Source: arXiv
Progress summary
A new computation found no counterexample to the conjecture below an enormous bound, but the conjecture itself remains open.
Frobenius proposed in 1913 that every Markov number occurs as the largest entry of only one positive-integer solution of , up to exchanging the smaller entries.
Known results
- Rabideau and Schiffler proved Aigner’s fixed-numerator ordering conjecture in 2020.
- Rabideau, Schiffler, Lee, and Li proved the fixed-denominator and fixed-sum ordering conjectures in February 2023.
- Computation verified uniqueness for the first Markov numbers, up to .
October 31, 2026 computational verification
Hu Tan and Ying Zhang report an exhaustive search with no counterexample through , covering triples with distinct maximal coordinates. This is substantial finite evidence, not a proof of the conjecture, and the computation has not been independently rerun.
Current status (as of November 2026): The conjecture remains open; uniqueness is established only in partial cases and the reported computation is unverified finite evidence.
Solutions 0
No solutions have been posted yet.