The strong approximation conjecture for the Markoff graph

Let M\mathcal{M} be the set of Markoff triples over Z\mathbb{Z}, let Mp\mathcal{M}_p be the set of their reductions modulo a prime pp, and let Gp×\mathcal{G}^\times_p be the Markoff graph modulo pp. The canonical projection identifies triples congruent modulo pp. Strong approximation conjecture. For every prime pp, the Markoff graph Gp×\mathcal{G}^\times_p is connected and is equivalent to G×\mathcal{G}^\times with triples congruent modulo pp identified; equivalently, the canonical projection MMp\mathcal{M}\to\mathcal{M}_p is onto. This conjecture asserts that every solution to the Markoff equation modulo a prime lifts to a Markoff triple over Z\mathbb{Z}. 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

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.