Lexicographic shellability for balanced complexes
Patricia Hersh
Abstract
We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the CL-shellability criterion of Björner 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 S2 Sn of symmetric groups, and we provide a partitioning for the quotient complex Δ(Πn)/Sn . Stanley asked for a description of the symmetric group representation βS on the homology of the rank-selected partition lattice ΠnS in [St2], and in particular he asked when the multiplicity bS(n) of the trivial representation in βS is 0. One consequence of the partitioning for is a (fairly complicated) combinatorial interpretation for bS(n) ; another is a simple proof of Hanlon's result that b1,..., i(n)=0. Using a result of Garsia and Stanton, we deduce from our shelling for Δ(B2n)/S2 Sn that the ring of invariants k[x1,..., x2n]S2 Sn is Cohen-Macaulay over any field k.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan