Higher determinants and the matrix-tree theorem
From MaRDI portal
Publication:6264404
arXiv1508.02245MaRDI QIDQ6264404FDOQ6264404
Authors: Yu Burman 
Publication date: 10 August 2015
Abstract: The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to present a generalization of the (nonsymmetric) matrix-tree theorem containing no trees and essentially no matrices. Instead of trees we consider acyclic directed graphs with a prescribed set of sinks, and instead of determinant, a polynomial invariant of the matrix determined by directed graph such that any two vertices of the same connected component are mutually reacheable.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: Higher determinants and the matrix-tree theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264404)
