A colourful path to matrix-tree theorems
DOI10.5802/ALCO.100zbMATH Open1436.05049arXiv1903.02491OpenAlexW3105396499MaRDI QIDQ1985361FDOQ1985361
Authors: Adrien Kassel, Thierry Lévy
Publication date: 7 April 2020
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.02491
Recommendations
simplicial complexesdeterminantholonomyLaplaciancyclesforestsmatrix-tree theorembicircular matroidsordered productscircular matroidspseudoforestsQ-determinant
Determinants, permanents, traces, other special matrix functions (15A15) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Signed graphs
- Title not available (Why is that?)
- A combinatorial approach to matrix algebra
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Simplicial matrix-tree theorems
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Spanning forests and the vector bundle Laplacian
- Simplicial and cellular trees
- Counting colorful multi-dimensional trees
- Determinants of Laplacians on graphs
- RANDOM COMPLEXES AND ℓ2-BETTI NUMBERS
- Directed rooted forests in higher dimension
- Covariant Symanzik identities
- Learning about critical phenomena from scribbles and sandpiles
Cited In (3)
This page was built for publication: A colourful path to matrix-tree theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985361)