Papers › On computing finite index subgroups of PSL(2,Z)
On computing finite index subgroups of PSL(2,Z)
Nicolás Mayorga Uruburu, Ariel Pacetti, Leandro Vendramin
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.
We present a method to compute finite index subgroups of PSL₂(ℤ). Our strategy follows Kulkarni's ideas, the main contribution being a recursive method to compute bivalent trees and their automorphism group. As a concrete application, we compute all subgroups of index up to 20. We then use this database to produce tables with several arithmetical properties.
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