Papers › Modular algorithms for Gross-Stark units and Stark-Heegner points
Modular algorithms for Gross-Stark units and Stark-Heegner points
Håvard Damm-Johnsen
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 recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are p-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical algorithm for explicitly computing these logarithms to specified precision, and how to recover the exact values of the Gross-Stark units and Stark-Heegner points from them. Key tools are overconvergent modular forms, reduction theory of quadratic forms and Newton polygons. As an application, we tabulate Brumer-Stark units in narrow Hilbert class fields of real quadratic fields with discriminants up to $10000$, for primes less than $20$, as well as Stark-Heegner points on elliptic curves.
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