Matrix-tree theorems and discrete path integration
From MaRDI portal
Publication:472420
DOI10.1016/j.laa.2014.09.049zbMath1310.15010arXiv1109.6625OpenAlexW2096367125MaRDI QIDQ472420
Anastasia V. Trofimova, Andrey Ploskonosov, Yu. M. Burman
Publication date: 19 November 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6625
Related Items (7)
Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian ⋮ Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups ⋮ Generating functions and counting formulas for spanning trees and forests in hypergraphs ⋮ Coxeter factorizations and the matrix tree theorem with generalized Jucys-Murphy weights ⋮ Unnamed Item ⋮ Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems ⋮ Higher matrix-tree theorems and Bernardi polynomial
Cites Work
- Unnamed Item
- Spanning forests and the vector bundle Laplacian
- Around matrix-tree theorem
- Cycle factorizations and 1-faced graph embeddings
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- Determinants of Laplacians on graphs
- Linear Algebra and Geometry
- Simplicial matrix-tree theorems
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Finite-Dimensional Division Algebras over Fields
This page was built for publication: Matrix-tree theorems and discrete path integration
