A Triplet Tree Forms One of the Most Beautiful Structures in Math | Quanta Magazine
number-theorymarkov-numbersmathematicsirrational-numberscombinatorics
Abstraction: Markov numbers, their triplet tree structure, and the uniqueness conjecture
Key points:
- Markov's 1879 equation x²+y²+z²=3xyz generates integer solutions ("Markov triples") via the rule (a,b,c) → (a,b,3ab−c), forming a binary tree of solutions
- The golden ratio φ is the hardest irrational to approximate by fractions; Markov triples index all the next-hardest irrationals
- The Fibonacci sequence and Pell sequence both appear as branches of the Markov tree, called "one of the most beautiful things in mathematics"
- Georg Frobenius (1913) conjectured that the largest number in any Markov triple uniquely determines the other two — still unproven after 110 years
- Three of Aigner's 2013 conjectures (monotonicity of Markov numbers by index) were proved by Rabideau & Schiffler in 2020–2023; researchers believe the uniqueness conjecture may be provable within five years
- Markov numbers arise across combinatorics, number theory, geometry, and graph theory — rare case of one equation resonating throughout mathematics
Connections: Quanta Magazine · Number Theory · Markov Numbers · Irrational Approximation