Year-end Sale % OFF 
Abstract
The Markoff graphs modulo p were proven by Chen (Ann Math 199(1), 2024) to be connected for all but finitely many primes, and Baragar (The Markoff equation and equations of Hurwitz. Brown University, 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 paper, we provide an algorithmic realization of the process introduced by Bourgain et al. [arXiv:1607.01530] to test whether the Markoff graph modulo p is connected for arbitrary primes. Our algorithm runs in o(p1+ϵ) time for every ϵ>0 0$$\\end{document}]]>. We demonstrate this algorithm by confirming that the Markoff graph modulo p is connected for all primes less than one million.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
