Simplicial matrix-tree theorems
From MaRDI portal
Publication:3642704
DOI10.1090/S0002-9947-09-04898-3zbMath1207.05227arXiv0802.2576MaRDI QIDQ3642704
Art M. Duval, Jeremy L. Martin, Caroline J. Klivans
Publication date: 6 November 2009
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.2576
Trees (05C05) Exact enumeration problems, generating functions (05A15) Algebraic combinatorics (05E99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Relations of low-dimensional topology with graph theory (57M15) Combinatorial aspects of simplicial complexes (05E45)
Related Items
Abelian networks. III: The critical group, Topology and geometry of random 2-dimensional hypertrees, Extremum problems for eigenvalues of discrete Laplace operators, A higher Boltzmann distribution, Simplicial networks and effective resistance, Isoperimetric inequalities in simplicial complexes, On the topology of rooted forests in higher dimensions, Quantitative null-cobordism, A Cheeger-type inequality on simplicial complexes, Melonic phase transition in group field theory, A combinatorial mapping for the higher-dimensional matrix-tree theorem, On the topology of no \(k\)-equal spaces, Total positivity in multivariate extremes, Determinant of the finite volume Laplacian, A formula for simplicial tree-numbers of matroid complexes, Mixing in High-Dimensional Expanders, On the Tutte-Krushkal-Renardy polynomial for cell complexes, Critical groups of simplicial complexes, Spectra of combinatorial Laplace operators on simplicial complexes, Unnamed Item, On the rooted forests in triangulated closed manifolds, Matrix-tree theorems and discrete path integration, Perfect quantum state transfer in weighted paths with potentials (loops) using orthogonal polynomials, Stanley depth and simplicial spanning trees, Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems, On eigenvalues of random complexes, A colourful path to matrix-tree theorems, Directed rooted forests in higher dimension, Generalized loop‐erased random walks and approximate reachability, Cellular spanning trees and laplacians of cubical complexes, A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes, Kirchhoff index of simplicial networks, The enumeration of spanning tree of weighted graphs, A polynomial invariant and duality for triangulations, The worst way to collapse a simplex, A family of matrix-tree multijections, High-dimensional networks and spanning forests, Counting spanning trees in almost complete multipartite graphs, Cuts and flows of cell complexes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning trees and function classes
- Higher-dimensional tree structures. I
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- A relative Laplacian spectral recursion
- An extended Euler-Poincaré theorem
- Counting colorful multi-dimensional trees
- Cohen-Macaulay quotients of polynomial rings
- On the Betti numbers of chessboard complexes
- Factorizations of some weighted spanning tree enumerators
- Enumerative properties of Ferrers graphs
- Obstructions to shiftedness
- The facet ideal of a simplicial complex
- Threshold graphs and related topics
- Combinatorics and commutative algebra.
- Cyclotomic and simplicial matroids
- Cyclotomic polytopes and growth series of cyclotomic lattices
- Face numbers and nongeneric initial ideals
- Shifted simplicial complexes are Laplacian integral
- On $W$-bases of directed graphs
- Simplical Geometry and Transportation Polytopes
- Chessboard Complexes and Matching Complexes
- Combinatorial Laplacians of matroid complexes
- Properties and characterizations of k ‐trees
- Combinatorial Laplacian of the matching complex
