ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
Simplicial matrix-tree theorems
dc.contributor.author | Duval, Art M. | |
dc.contributor.author | Klivans, Caroline J. | |
dc.contributor.author | Martin, Jeremy L. | |
dc.date.accessioned | 2010-05-12T15:26:18Z | |
dc.date.available | 2010-05-12T15:26:18Z | |
dc.date.issued | 2009 | |
dc.identifier.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. | |
dc.identifier.uri | http://hdl.handle.net/1808/6201 | |
dc.description | First published in Transactions of the American Mathematical Society in volume 361 (2009), no. 11, 6073--6114, published by the American Mathematical Society | |
dc.description.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 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. | |
dc.language.iso | en_US | |
dc.publisher | American Mathematical Society | |
dc.relation.isversionof | http://www.ams.org/journals/tran/2009-361-11/S0002-9947-09-04898-3/S0002-9947-09-04898-3.pdf | |
dc.relation.hasversion | http://arxiv.org/pdf/0802.2576 | |
dc.title | Simplicial matrix-tree theorems | |
dc.type | Article | |
kusw.kuauthor | Martin, Jeremy L. | |
kusw.kudepartment | Mathematics | |
kusw.oastatus | fullparticipation | |
kusw.oaversion | Scholarly/refereed, publisher version | |
kusw.oapolicy | This item meets KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess |