Papers › Computing intersections of closed geodesics on the modular curve
Computing intersections of closed geodesics on the modular curve
James Rickards
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In a recent work of Duke, Imamo\={g}lu, and T\'{o}th, the linking number of certain links on the space SL(2,ℤ)\SL(2,ℝ) 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections