7 citations to https://www.mathnet.ru/rus/qjm6
  1. Colby Austin Brown, “An almost linear time algorithm testing whether the Markoff graph modulo p is connected”, Res. number theory, 11:1 (2025)  crossref
  2. Joseph H. Silverman, “A heuristic subexponential algorithm to find paths in Markoff graphs over finite fields”, Res. number theory, 11:1 (2025)  crossref
  3. Jillian Eddy, Elena Fuchs, Matthew Litman, Daniel E. Martin, Nico Tripeny, “Connectivity of Markoff mod‐p graphs and maximal divisors”, Proceedings of London Math Soc, 130:2 (2025)  crossref
  4. Elena Fuchs, Matthew Litman, Joseph H. Silverman, Austin Tran, “Orbits on K3 Surfaces of Markoff Type”, Experimental Mathematics, 2023, 1  crossref
  5. Bryce Kerr, Jorge Mello, Igor E. Shparlinski, “An effective local-global principle and additive combinatorics in finite fields”, JAMA, 2023  crossref
  6. Sergei V. Konyagin, Igor E. Shparlinski, Ilya V. Vyugin, Analysis at Large, 2022, 273  crossref
  7. Matthew de Courcy-Ireland, Michael Magee, “Kesten–McKay law for the Markoff surface mod p”, Annales Henri Lebesgue, 4 (2021), 227  crossref