COMPUTATION OF POLARIZED METRIZED GRAPH INVARIANTS BY USING DISCRETE LAPLACIAN MATRIX

Creative Commons License

Cinkir Z.

MATHEMATICS OF COMPUTATION, cilt.84, sa.296, ss.2953-2967, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 84 Sayı: 296
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1090/mcom/2981
  • Dergi Adı: MATHEMATICS OF COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2953-2967
  • Abdullah Gül Üniversitesi Adresli: Evet

Özet

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.