Computation of Polarized Metrized Graph Invariants By Using Discrete Laplacian Matrix

Details Computation of Polarized Metrized Graph Invariants By Using Discrete Laplacian Matrix Computation of Polarized Metrized Graph Invariants By Using Discrete Laplacian Matrix

2012-02-21

arxiv.org/abs/1202.4641v1

Mathematics

Number Theory

3 figure and 6 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computation of Polarized Metrized Graph Invariants By Using Discrete Laplacian Matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computation of Polarized Metrized Graph Invariants By Using Discrete Laplacian Matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of Polarized Metrized Graph Invariants By Using Discrete Laplacian Matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-423560