McCullough–Wanderley classification conjecture
For the generalized Markoff surface , determine the -orbits on . The core predicted assertion specified by the supplied sources is that there is a finite exceptional set such that, for all but finitely many primes , every orbit not arising from the reductions modulo of points of has cardinality at least ; together with the associated orbit-divisibility statements, this should give the McCullough–Wanderley classification of the relevant orbits and generating pairs.
References
- Stable reduction and large Nielsen orbits on generalized Markoff surfaces — arXiv — William Y. Chen
Source: arXiv
Progress summary
A new argument establishes the predicted classification for almost every prime, but finitely many primes remain unresolved, so the conjecture is not fully settled.
McCullough and Wanderley formulated the classification conjectures in 2013; the case traces back to Baragar (1991). The conjecture predicts the relevant orbit classification for Markoff triples and generating pairs.
Known results
- Baragar (1991) posed the strong-approximation conjecture for the Markoff surface.
- Bourgain, Gamburd, and Sarnak established transitivity for all but finitely many primes in the classical nonzero Markoff surface case.
- Chen proved the required orbit-size divisibility for , apart from the exceptional point .
- A recent arXiv paper proves the -Classification Conjecture for primes satisfying , yielding the corresponding partial classifications.
October 2026 large-orbit bounds
William Y. Chen claims that stable-reduction arguments supply the needed lower bounds for nonexceptional generalized Markoff orbits, giving an essentially complete asymptotic classification of the relevant Hurwitz-stack components. The claim leaves finitely many primes unresolved and has not been independently verified here.
Current status (as of October 2026): The conjecture has substantial partial results and a claimed asymptotic resolution, but the finitely many exceptional primes remain open and the latest claim is unverified.
Solutions 0
No solutions have been posted yet.