Computation of polarized metrized graph invariants by using discrete Laplacian matrix

DOI10.1090/MCOM/2981zbMATH Open1320.05071arXiv1202.4641OpenAlexW2143664499MaRDI QIDQ5501154FDOQ5501154

Authors: Zübeyir Çınkır 

Publication date: 13 August 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1202.4641

Recommendations

• The Laplacian eigenvalues and invariants of graphs
• Laplacian spectra and invariants of graphs
• The tau constant and the discrete Laplacian matrix of a metrized graph
• A computational approach to construct a multivariate complete graph invariant
• Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
• Computing the Laplacian spectra of some graphs
• scientific article; zbMATH DE number 510842
• Polynomial Invariants of Graphs
• On Laplacian-energy-like invariant of a graph
• A matrix representation of graphs and its spectrum as a graph invariant

zbMATH Keywords

metrized graphtau constantpseudo inversepolarized metrized graphrelative dualizing sheafresistance functiondiscrete Laplacian matrixinvariants of polarized metrized graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) [https://portal.mardi4nfdi.de/w/index.php?search=%2211G30%22&title=Special%3ASearch&profile=advanced&fulltext=1&ns120=1 Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Varieties over global fields (11G35) Heights (11G50) Applications of graph theory to circuits and networks (94C15) Arithmetic varieties and schemes; Arakelov theory; heights (14G40)

Cites Work

• Gaussian elimination is not optimal
• Gross-Schoen cycles and dualising sheaves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiplying matrices faster than coppersmith-winograd
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix multiplication via arithmetic progressions
• Metrized graphs, Laplacian operators, and electrical networks
• The capacity pairing.
• The tau constant and the edge connectivity of a metrized graph
• Zhang's conjecture and the effective Bogomolov conjecture over function fields
• The tau constant and the discrete Laplacian matrix of a metrized graph
• Title not available (Why is that?)
• Harmonic Analysis on Metrized Graphs
• The tau constant of a metrized graph and its behavior under graph operations
• Admissible pairing on a curve
• Title not available (Why is that?)
• Effective calculation of the geometric height and the Bogomolov conjecture for hyperelliptic curves over function fields
• Geometric Bogomolov's conjecture for curves of genus 3 over function fields.
• Bogomolov conjecture over function fields for stable curves with only irreducible fibers (Version 2.0)
• Second variation of Zhang’s λ-invariant on the moduli space of curves
• The geometric Bogomolov conjecture for curves of small genus
• Bogomolov conjecture for curves of genus 2 over function fields
• Graph invariants and the positivity of the height of the Gross-Schoen cycle for some curves
• Admissible constants for genus 2 curves
• Title not available (Why is that?)

Cited In (3)

• Admissible invariants of genus 3 curves
• Explicit computation of certain Arakelov-Green functions
• On the height of Gross-Schoen cycles in genus three

Uses Software

• Mathematica
• Matlab

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)