arXiv Analytics

Sign in

arXiv:math/0401006 [math.CO]AbstractReferencesReviewsResources

Geometrically constructed bases for homology of partition lattices of types A, B and D

Anders Björner, Michelle L. Wachs

Published 2004-01-02Version 1

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96], thus answering a question asked by R. Stanley. More explicitly, the following general technique is presented and utilized. Let A be a central and essential hyperplane arrangement in R^d. Let R_1,...,R_k be the bounded regions of a generic hyperplane section of A. We show that there are induced polytopal cycles \rho_{R_i} in the homology of the proper part \bar{L_A} of the intersection lattice such that {\rho_{R_i}}_{i=1,...,k} is a basis for \tilde H_{d-2}(\bar{L_A}). This geometric method for constructing combinatorial homology bases is applied to the Coxeter arrangements of types A, B and D, and to some interpolating arrangements.

Related articles: Most relevant | Search more
arXiv:1606.01443 [math.CO] (Published 2016-06-05)
Filters in the partition lattice
arXiv:0806.4151 [math.CO] (Published 2008-06-25, updated 2008-07-15)
Geometrically Constructed Bases for Homology of Non-Crossing Partition Lattices
arXiv:math/0409235 [math.CO] (Published 2004-09-14, updated 2005-09-13)
Complexes of trees and nested set complexes