Determinant identities for Laplace matrices
type: Item
instance of: scholarly article
title: Determinant identities for Laplace matrices
zbMATH Open document ID: 1184.15006
author: Elmar Teufl
author: Stephan Wagner
published in: Linear Algebra and its Applications
publication date: 2009-12-18T00:00:00Z
review text: Let \(L\) be a real \(n\times n\) matrix. If \(A=\{a_1,\dots,a_m\}\) and \(B=\{b_1,\dots,b_m\}\) are subsets of \(\{1,\dots,n\}\) with \(a_1<\dots<a_m\), \(b_1<\dots<b_m\), denote by \(D^A_B\) the minor of \(L\) obtained by deleting the rows in~\(A\) and columns in~\(B\). Sylvester's determinantal identity states that \[ D^A_B(D^{a_k}_{b_l})^{m-2} = (-1)^{k+l}\sum_{\pi\in S_m\atop\pi(l)=k} \text{sgn}\,\pi\prod_{1\leq i\leq m\atop i\neq l}D^{a_{\pi(i)}a_k}_{b_ib_l} \] for all \(k,l=1,\dots,m\) [see, e.g., \textit{T. Muir}, A treatise on the theory of determinants. Revised and enlarged by W.~H.~Metzler, Dover Publ. Inc., New York (1960) and \textit{B.~Leclerc}, Adv. Math. 100, 101--132 (1993; Zbl 0804.05074)]. Based on this identity, the present authors show that if \(L\) is a Laplace matrix (i.e., symmetric with row and column sums zero), then \(D^A_B\) can be expressed in terms of the \(n\choose 2\) minors obtained by deleting two rows and the corresponding columns. They apply this result to a problem concerning electrical networks and to another problem on spanning tree enumeration. These problems were the original motivation of this paper.
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 5650052
zbMATH Keywords: minors
zbMATH Keywords: electrical networks
zbMATH Keywords: spanning tree enumeration
zbMATH Keywords: Sylvester's determinantal identity
zbMATH Keywords: Laplace matrix
reviewed by: Jorma K. Merikoski
MaRDI profile type: Publication
full work available at URL: j.laa.2009.08.028
OpenAlex ID: W2068861748
cites work: Q3286355
cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem
cites work: Matrix tree theorems
cites work: Some determinant expansions and the matrix-tree theorem
cites work: Q4398864
cites work: Analysis on fractals
cites work: The short-cut test
cites work: The number of spanning trees in self-similar graphs
cites work: Spanning trees on the Sierpinski gasket
cites work: On identities satisfied by minors of a matrix
cites work: Q3176622
cites work: Q3416249
cites work: Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
cites work: Q5528477
cites work: Q4427630
cites work: Lectures on probability theory and statistics. Ecole d'Eté de probabilités de Saint-Flour XXV - 1995. Lectures given at the summer school in Saint-Flour, France, July 10-26, 1995
cites work: Spectral properties of self-similar lattices and iteration of rational maps
DOI: 10.1016/J.LAA.2009.08.028
Recommended article: On minors of the compound matrix of a Laplacian
Recommended article: Linear Algebraic Techniques for Spanning Tree Enumeration
Recommended article: Determinantal formulae for matrices with sparse inverses. II: Asymmetric zero patterns
Recommended article: An identity for the determinant
Recommended article: Enumeration of Hamiltonian Cycles and Paths in a Graph
Recommended article: Q3176622
Recommended article: Resultants and trees
Recommended article: Q3109945
Recommended article: Linear algebraic techniques for weighted spanning tree enumeration
description: scientific article; zbMATH DE number 5650052