Explicit computation of certain Arakelov-Green functions

DOI10.1215/21562261-2801804MaRDI QIDQ482147zbMATH OpenOpenAlexFDO

Authors Zübeyir Çınkır

Publication date 19 December 2014

Published in Kyoto Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.0478

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of graph theory to circuits and networks (94C15) Arithmetic varieties and schemes; Arakelov theory; heights (14G40)

Abstract: Arakelov-Green functions defined on metrized graphs have important role in relating arithmetical problems on algebraic curves into graph theoretical problems. In this paper, we clarify the combinatorial interpretation of certain Arakelov-Green functions by using electric circuit theory. The formulas we gave clearly show that such functions are piece-wisely defined, and each piece is a linear or quadratic function on each pair of edges of metrized graphs. These formulas lead to an algorithm for explicit computation of Arakelov-Green functions.

Recommendations

• Computation of polarized metrized graph invariants by using discrete Laplacian matrix
• Harmonic Analysis on Metrized Graphs
• Bounds on canonical Green's functions
• The capacity pairing.
• Computing linear systems on metric graphs

Cited in

(5)

• Admissible invariants of genus 3 curves
• Computation of the Artin-Greenberg function of a planar branch
• The tau constant of a metrized graph and its behavior under graph operations
• Chern-Weil theory for line bundles with the family Arakelov metric
• Computability of series representations for Green's functions in a rectangle

This page was built for publication: Explicit computation of certain Arakelov-Green functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482147)