An almost linear time algorithm testing whether the Markoff graph modulo \(p\) is connected

DOI10.1007/S40993-024-00592-9MaRDI QIDQ6653360

Colby Austin Brown

Publication date: 16 December 2024

Published in: Research in Number Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Number theory (11-XX)

Cites Work

• Greatest common divisors of \(u-1, v-1\) in positive characteristic and rational points on curves over finite fields
• Integral points on Markoff type cubic surfaces
• Standard generators of finite fields and their cyclic subgroups
• On the Structure of Graphs of Markoff Triples
• Experiments with the Markoff Surface
• On indefinite binary quadratic forms.
• Nonabelian level structures, Nielsen equivalence, and Markoff triples

This page was built for publication: An almost linear time algorithm testing whether the Markoff graph modulo \(p\) is connected

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653360)