Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
DOI10.1007/s00454-018-0041-xzbMath1409.05223arXiv1506.03881OpenAlexW2963310645WikidataQ128900420 ScholiaQ128900420MaRDI QIDQ1739195
Sylvain E. Cappell, Edward Y. Miller
Publication date: 25 April 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.03881
simplicial complexescombinatorial Laplaciancell complexesspanning treesenumerative combinatoricsReidemeister-Franz torsiongeometrical combinatoricshigh-dimensional generalizations of graph theoryKirchhhoff's theoremTrent's theorem
Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15) Enumerative combinatorics (05A99) Simplicial sets and complexes in algebraic topology (55U10) Simple homotopy type, Whitehead torsion, Reidemeister-Franz torsion, etc. (57Q10) Combinatorial aspects of simplicial complexes (05E45)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Kirchhoff's theorems with coefficients in a line bundle
- Matrix-tree theorems and discrete path integration
- Directed rooted forests in higher dimension
- On the optimality of the Arf invariant formula for graph polynomials
- Spanning forests and the vector bundle Laplacian
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Around matrix-tree theorem
- A duality theorem for Reidemeister torsion
- Counting colorful multi-dimensional trees
- Matrix tree theorems
- The Laplacian and Dirac operators on critical planar graphs
- A higher Boltzmann distribution
- Homotopieringe und Linsenräume
- Kirchhoff's theorems in higher dimensions and Reidemeister torsion
- R-torsion and the Laplacian on Riemannian manifolds
- Probability on Trees and Networks
- Simplicial and cellular trees
- An Algebraic Proof of Kirchhoff's Network Theorem
- On Invariants of Graphs with Applications to Knot Theory
- RANDOM COMPLEXES AND ℓ2-BETTI NUMBERS
- Simplicial matrix-tree theorems
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Simplical Geometry and Transportation Polytopes
- Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
- Algebraic Graph Theory
- On the Abstract Properties of Linear Dependence
- On Vector Spaces Associated with a Graph
- Whitehead torsion
- Graph property recognition machines
- Über die Torsion einer Überdeckung.
- A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
- The asymptotic determinant of the discrete Laplacian
This page was built for publication: Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
