EL-labelings, supersolvability and 0-Hecke algebra actions on posets (Q1865411): Difference between revisions

Given (in this case) a finite graded/ranked poset \(P\), let \({\mathcal E}(P)=\{(s,t)\mid t\) covers \(s\}\) and \(\lambda:{\mathcal E}(P)\to Z\) an edge-labeling with a maximal chain \(m\): \(s=s_0<s_1< \cdots<s_k=t\) of \([s,t]\) increasing if \(\lambda(s_0,s_1) \leq\cdots\leq \lambda(s_{k-1}, s_k)\), called an EL-labeling if (i) every interval has at least one increasing maximal chain and (ii) any other maximal chain \(m'\) has \(\lambda(m')>_L \lambda(m)\) in the lexicographic order of finite integer sequences, resulting in an EL-shellable \((\Rightarrow\) shellable \(\Rightarrow\) Cohen-Macaulay) poset. These have a substantial literature. If for every maximal chain on \([\widehat 0,\widehat 1]=P\), \(m:\widehat 0= x_0<x_1<\cdots< x_n=\widehat 1\), \(\lambda(m)\) (or \(i\to\lambda(x_{i-1}, x_i))\) is a permutation of \(n\), then \(\lambda\) is an \(S_n\)-EL-labeling (snelling) and \(P\) is snellable. Finite distributive lattices are snellable and it is a main goal of this interesting paper to demonstrate that a finite graded lattice is supersolvable if it is snellable. Another main result asserts that if \(P\) is a poset with \(\widehat 0\) and \(\widehat 1\) which is graded and \(\underline 2\oplus \underline 2\) (or bowtie) free, it is snellable iff it has a ``good \(H_n(0)\)-action'', which describes a type \(A\) 0-Hecke algebra on the maximal chains (via mappings on permutations in the snellable case) whose ``character has characteristic closely related to Ehrenborg's quasi-symmetric function'' (author)), and applying this second observation to finite graded lattices in particular since they are obviously bowtie-free. Notice that there are non-bowtie-free finite graded posets \((\underline 1\oplus\underline 2\oplus \underline 2\oplus 1)\) which, though unsnellable, have ``good \(H_n(0)\)-action'' in the sense of this paper.