Lexicographic shellability for balanced complexes

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

28 pages, 10 figures

Scientific paper

We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Bj\"orner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We give a lexicographic shelling for the quotient of the order complex of a Boolean algebra of rank $2n$ by the action of the wreath product $S_2\wr S_n$ of symmetric groups, and we provide a partitioning for the quotient complex $\Delta (\Pi_n)/S_n $. Stanley asked for a description of the symmetric group representation $\beta_S $ on the homology of the rank-selected partition lattice $\Pi_n^S $ in [St2], and in particular he asked when the multiplicity $b_S(n)$ of the trivial representation in $\beta_S$ is 0. One consequence of the partitioning for $\dps $ is a (fairly complicated) combinatorial interpretation for $b_S(n) $; another is a simple proof of Hanlon's result that $b_{1,..., i}(n)=0$. Using a result of Garsia and Stanton, we deduce from our shelling for $\Delta (B_{2n})/S_2 \wr S_n$ that the ring of invariants $k[x_1,..., x_{2n}]^{S_2\wr S_n}$ is Cohen-Macaulay over any field $k$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lexicographic shellability for balanced complexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lexicographic shellability for balanced complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lexicographic shellability for balanced complexes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-635329

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.