The strong approximation conjecture for the Markoff graph
The strong approximation conjecture for the Markoff graph
Let be the set of Markoff triples over , let be the set of their reductions modulo a prime , and let be the Markoff graph modulo . The canonical projection identifies triples congruent modulo . Strong approximation conjecture. For every prime , the Markoff graph is connected and is equivalent to with triples congruent modulo identified; equivalently, the canonical projection is onto. This conjecture asserts that every solution to the Markoff equation modulo a prime lifts to a Markoff triple over . Strong approximation is known for all but finitely many primes, but remains open in general; it is a first step toward the expander-family conjecture for these graphs.
Sources & referencesView supporting material
Primary source
Colby Austin Brown, “An almost linear time algorithm testing whether the Markoff graph modulo p is connected”, arXiv:2401.00630 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.