Enumeration of spanning trees in simplicial complexes
نویسنده
چکیده
The Kirchoff Matrix Tree Theorem states that the number of spanning trees in a graph G is equal to the absolute value of any cofactor of the Laplacian matrix of G. As the theory of simplicial complexes is a generalization of the theory of graphs one would suspect that there is a generalization of the notion of spanning trees to simplicial complexes, such that the number of spanning trees in a given simplicial complex ∆ is counted in a similiar way. We provide such a generalization and show that these trees, weighted with the number of elements of the torsion subgroup of their individual kth homological group, can be counted by the absolute value of the determinant of a certain submatrix of the Laplacian matrix of ∆. This paper also gives an overview of the field of enumeration of trees using the Laplacian matrix.
منابع مشابه
Cellular Spanning Trees and Laplacians of Cubical Complexes
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit formulas for spanning tree enumerators and Laplacian eigenvalues of cubes; the latter are integers. We prove a weighted version of the eigenvalue formula, pr...
متن کاملSimplicial Matrix-Tree Theorems
Abstract. We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes ∆, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Lapl...
متن کاملA Weighted Cellular Matrix-tree Theorem, with Applications to Complete Colorful and Cubical Complexes
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give weighted generalizations of the tree enumeration formulas of Adin for complete colorful complexes, and of Duval, Klivans and Martin for skeleta of hypercubes...
متن کاملEnumerating bases of self-dual matroids
We define involutively self-dual matroids and prove a relationship between the bases and selfdual bases of these matroids. We use this relationship to prove an enumeration formula for the higher dimensional spanning trees in a class of cell complexes. This gives a new proof of Tutte’s theorem that the number of spanning trees of a central reflex is a perfect square and solves a problem posed by...
متن کاملRandom Complexes and l 2 - Betti Numbers
Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first l-Betti number of the group. Our main aim, however, is to present the basic elements of a higher-dimensional analogue on finite and infinite CW-complexes, which relate to the higher l-Betti numbers. One consequence is a ...
متن کامل