Computation of polarized metrized graph invariants by using discrete Laplacian matrix

From MaRDI portal
Publication:5501154




Abstract: Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian matrix and its pseudo inverse. Algorithms we give can be used for both symbolic and numerical computations. We present various examples to illustrate the implementation of these algorithms.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: Computation of polarized metrized graph invariants by using discrete Laplacian matrix

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