Complexes of trees and nested set complexes
Preprint
Abstract
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be obtained from the complex of trees by a sequence of stellar subdivisions. We provide an explicit cohomology basis for the complex of trees that emerges naturally from this context. Motivated by these results, we review the generalization of complexes of trees to complexes of $k$-trees by Hanlon, and we propose yet another, in the context of nested set complexes more natural, generalization.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- On the topology of nested set complexesProceedings of the American Mathematical Society, 2004
- Incidence combinatorics of resolutionsSelecta Mathematica, 2004
- Chow rings of toric varieties defined by atomic latticesInventiones Mathematicae, 2003
- Shellable nonpure complexes and posets. IITransactions of the American Mathematical Society, 1997
- Wonderful models of subspace arrangementsSelecta Mathematica, 1995
- The Homology of "k-Equal" Manifolds and Related Partition LatticesAdvances in Mathematics, 1995
- Local structure of some Out(Fn)-complexesProceedings of the Edinburgh Mathematical Society, 1990
- On lexicographically shellable posetsTransactions of the American Mathematical Society, 1983
- Some aspects of groups acting on finite posetsJournal of Combinatorial Theory, Series A, 1982
- Shellable and Cohen-Macaulay partially ordered setsTransactions of the American Mathematical Society, 1980