Computation of polarized metrized graph invariants by using discrete laplacian matrix
MetadataShow full item record
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry have been 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. The algorithm we give can be used for both symbolic and numerical computations. We present various examples to illustrate the implementation of these algorithms.