Simplicial matrix-tree theorems
View/ Open
Issue Date
2009Author
Duval, Art M.
Klivans, Caroline J.
Martin, Jeremy L.
Publisher
American Mathematical Society
Type
Article
Article Version
Scholarly/refereed, publisher version
Published Version
http://www.ams.org/journals/tran/2009-361-11/S0002-9947-09-04898-3/S0002-9947-09-04898-3.pdfVersion
http://arxiv.org/pdf/0802.2576
Metadata
Show full item recordAbstract
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 Laplacian matrix of Δ. As in the graphic case, one can obtain
a more finely weighted generating function for simplicial spanning trees by assigning an indeterminate to each vertex of Δ and replacing the entries of the Laplacian with Laurent monomials. When Δ is a shifted complex, we give a combinatorial interpretation of the eigenvalues of its weighted Laplacian and prove that they determine its set of faces uniquely, generalizing known results about threshold graphs and unweighted Laplacian eigenvalues of shifted complexes.
Description
First published in Transactions of the American Mathematical Society in volume 361 (2009), no. 11, 6073--6114, published by the American Mathematical Society
Collections
Citation
Simplicial matrix-tree theorems (with Art M. Duval and Caroline J. Klivans), Transactions of the American Mathematical Society 361 (2009), no. 11, 6073--6114.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.