COMPUTATION OF POLARIZED METRIZED GRAPH INVARIANTS BY USING DISCRETE LAPLACIAN MATRIX

被引：3
|
作者：
Cinkir, Zubeyir [1 ]
机构：
[1] Zirve Univ, Dept Math, TR-27260 Gaziantep, Turkey
来源：
MATHEMATICS OF COMPUTATION | 2015年 / 84卷 / 296期
关键词：
Metrized graph; polarized metrized graph; invariants of polarized metrized graphs; the tau constant; resistance function; the discrete Laplacian matrix; pseudo inverse and relative dualizing sheaf; BOGOMOLOV CONJECTURE; GENUS; 2; CURVES;
D O I：
10.1090/mcom/2981
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：2953 / 2967
页数：15
相关论文
共 50 条
  • [31] On the Graph Construction of Signal De-Noising Method Using Laplacian Matrix
    Tseng, Chien-Cheng
    Lee, Su-Ling
    2020 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TAIWAN), 2020,
  • [32] Incremental eigenpair computation for graph Laplacian matrices: theory and applications
    Chen P.-Y.
    Zhang B.
    Hasan M.A.
    Social Network Analysis and Mining, 2018, 8 (1)
  • [33] On fast computation of directed graph Laplacian pseudo-inverse
    Boley, Daniel
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 623 : 128 - 148
  • [34] Fast computation of discrete invariants associated to a differential rational mapping
    Matera, G
    Sedoglavic, A
    JOURNAL OF SYMBOLIC COMPUTATION, 2003, 36 (3-4) : 473 - 499
  • [35] Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph
    Lin, Huiqiu
    Hong, Yuan
    Shu, Jinlong
    GRAPHS AND COMBINATORICS, 2015, 31 (03) : 669 - 677
  • [36] Using Matrix Methods for Polarized Light Analysis in Discrete Deflectors.
    Golovanevskii, E.I.
    Varshavskii, S.P.
    Izvestia vyssih ucebnyh zavedenij. Priborostroenie, 1980, 23 (05): : 74 - 78
  • [37] Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph
    Huiqiu Lin
    Yuan Hong
    Jinlong Shu
    Graphs and Combinatorics, 2015, 31 : 669 - 677
  • [38] SOME GRAPH INVARIANTS BASED IN THE EIGENVECTORS OF THE ADJACENCY MATRIX
    CVETKOVIC, DM
    GRAPH THEORY, 1989, : 31 - 42
  • [39] On the Ky Fan norm of the signless Laplacian matrix of a graph
    Pirzada, S.
    Ul Shaban, Rezwan
    Ganie, Hilal A.
    de Lima, L.
    COMPUTATIONAL & APPLIED MATHEMATICS, 2024, 43 (01):
  • [40] LAPLACIAN MATRIX LEARNING FOR SMOOTH GRAPH SIGNAL REPRESENTATION
    Dong, Xiaowen
    Thanou, Dorina
    Frossard, Pascal
    Vandergheynst, Pierre
    2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP), 2015, : 3736 - 3740
12345