Simplicial and Cellular Trees
View/ Open
Issue Date
2016-04-16Author
Duval, Art M.
Klivans, Caroline J.
Martin, Jeremy L.
Publisher
Springer International Publishing
Type
Article
Article Version
Scholarly/refereed, author accepted manuscript
Rights
© Springer International Publishing Switzerland 2016
Metadata
Show full item recordAbstract
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed first by Bolker, Kalai, and Adin, and more recently by numerous authors, the fundamental topological properties of a tree — namely acyclicity and connectedness — can be generalized to arbitrary dimension as the vanishing of certain cellular homology groups. This point of view is consistent with the matroid-theoretic approach to graphs, and yields higher-dimensional analogues of classical enumerative results including Cayley’s formula and the matrix-tree theorem. A subtlety of the higher-dimensional case is that enumeration must account for the possibility of torsion homology in trees, which is always trivial for graphs. Cellular trees are the starting point for further high-dimensional extensions of concepts from algebraic graph theory including the critical group, cut and flow spaces, and discrete dynamical systems such as the abelian sandpile model.
Collections
Citation
Art M. Duval, Caroline J. Klivans and Jeremy L. Martin. Simplicial and Cellular Trees. Recent Trends in Combinatorics (A. Beveridge, J. Griggs, L. Hogben, G. Musiker and P. Tetali, eds.), 713-752, IMA Vol. Math. Appl. 159, Springer, 2016.
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.