Papers › Computation of Admissible Arakelov-Green Functions on Metrized Graphs
Computation of Admissible Arakelov-Green Functions on Metrized Graphs
Ruben Merlijn van Dijk, Enis Kaya
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.
Metrized graphs are nonarchimedean analogues of Riemann surfaces, and Arakelov-Green functions on these graphs are of fundamental importance for some aspects of arithmetic geometry. In the present paper, we give an explicit formula for an admissible Arakelov-Green function on a metrized graph, extending Cinkir's formula for the canonical Arakelov-Green function. Based on our formula, we present and implement an algorithm in the computer algebra system SageMath for explicitly computing such functions. We illustrate our algorithm with computational examples.
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