Connectivity of Markoff mod‐p graphs and maximal divisors
Proceedings of the London Mathematical Society · 2025-02 · 130 (2)
DOI: 10.1112/plms.70027 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the London Mathematical Society, online erschienen am 15.02.2025. Verfasst von Jillian Eddy und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation.
Abstract (Originalsprache)
Markoff mod‐ graphs are conjectured to be connected for all primes . In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all . We also provide a method that quickly verifies connectivity for many primes below this bound. In our study of Markoff mod‐ graphs, we introduce the notion of maximal divisors of a number. We prove sharp asymptotic and explicit upper bounds on the number of maximal divisors, which ultimately improves the Markoff graph ‐bound by roughly 140 orders of magnitude as compared with an approach using all divisors.
Förderung
- National Science Foundation
Zitieren
APA
Eddy, J., Fuchs, E., Litman, M., Martin, D. E., & Tripeny, N. (2025). Connectivity of Markoff mod‐p graphs and maximal divisors. Proceedings of the London Mathematical Society, 130(2). https://doi.org/10.1112/plms.70027
Vancouver
Eddy J, Fuchs E, Litman M, Martin DE, Tripeny N. Connectivity of Markoff mod‐p graphs and maximal divisors. Proceedings of the London Mathematical Society. 2025;130(2). doi:10.1112/plms.70027
BibTeX
@article{Eddy2025,
author = {Eddy, Jillian and Fuchs, Elena and Litman, Matthew and Martin, Daniel E. and Tripeny, Nico},
title = {Connectivity of Markoff mod‐p graphs and maximal divisors},
journal = {Proceedings of the London Mathematical Society},
year = {2025},
volume = {130},
number = {2},
doi = {10.1112/plms.70027}
}
EUVIMED