{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/computing-intersections-of-closed-geodesics","title":"Computing intersections of closed geodesics on the modular curve","arxiv_id":"1909.04103","date":"2019-09-09","proceeding":null,"authors":["James Rickards"],"abstract":"In a recent work of Duke, Imamo\\={g}lu, and T\\'{o}th, the linking number of certain links on the space $\\text{SL}(2,\\mathbb{Z})\\backslash\\text{SL}(2,\\mathbb{R})$ is investigated. This linking number has an alternative interpretation as the intersection number of closed geodesics on the modular curve, which is the focus of this paper. By relating the intersection number to a combinatorial computation involving rivers of Conway topographs, an efficient algorithm for computing intersection numbers is produced. A formula for the total intersection of a pair of positive coprime fundamental discriminants is also derived, which can be thought of as a real quadratic analogue of a classical result of Gross and Zagier. The paper ends with numerical computations and distribution questions relating to intersection numbers.","url_abs":"https://arxiv.org/abs/1909.04103v3","url_pdf":"https://arxiv.org/pdf/1909.04103v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"computing-intersections-of-closed-geodesics","repo_url":"https://github.com/JamesRickards-Canada/Q-Quadratic","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}