This file can be used to add scheduled events to your calendar, however every program is unique. Below you will find what information is available, but if nothing else works try creating a new calendar in your program and using
The Markoff graphs modulo p were proven by Chen (2024) to be connected for all but finitely many primes, and Baragar (1991) conjectured that they are connected for all primes, equivalently that every solution to the Markoff equation modulo p lifts to a solution over Z. In this talk, we provide an algorithmic realization of the process introduced by Bourgain, Gamburd, and Sarnak to test whether the Markoff graph modulo p is connected for arbitrary primes. Our algorithm runs in o(p^(1+epsilon)) time for every epsilon > 0. We demonstrate this algorithm by confirming that the Markoff graph modulo p is connected for all primes less than one million. Finally, we discuss other approaches to decomposing the Markoff graph, with possible applications to determining its spectral properties.
Navigating the Markoff graph computationally
Tue, Nov. 12 11am (MATH 350)
Number Theorists (CU)
X
The faculty from the number theory group will each give a brief overview of what we do for research.
Navigating the Markoff graph computationally