Partially ordered sets associated with permutations (Q1122600)

Let \(\Sigma\) be a set of permutations of \([n]=\{1,...,n\}\). A poset P is called chain-permutational with respect to \(\Sigma\) iff the edges of the Hasse diagram of P can be labeled with labels from [n] so that the sequence of labels along each maximal chain of P is a permutation in \(\Sigma\), each permutation in \(\Sigma\) arises exactly once in this way and the cardinality of P is minimal with respect to this property. The author has shown that a chain-permutational poset is unique up to isomorphism for given \(\Sigma\), yielding the notation P(\(\Sigma)\). Further, P(\(\Sigma)\) is distributive if \(\Sigma\) is the family of linear extensions of some poset Q. The author studies in detail P(\(\Sigma)\) for 3 types of subsets \(\Sigma\) of the symmetric group \(S_ n:\) \(\Sigma^ 1_ n:=\{\sigma \in S_ n:\) \(\sigma^ 2=id\},\) \(\Sigma^ 2_ n:=\{\sigma \in S_ n:\) for no \(1\leq i_ 1<i_ 2<i_ 3\leq n\), \(\sigma (i_ 1)<\sigma (i_ 2)<\sigma (i_ 3)\},\) \(\Sigma^ 3_ n:=\{\sigma \in S_ n:\) for no \(1\leq i_ 1<i_ 2<i_ 3\leq n\), \(\sigma (i_ 1)<\sigma (i_ 2)\) and \(\sigma (i_ 1)<\sigma (i_ 3)\) and \(\sigma (i_ 2)>\sigma (i_ 3)\}.\) Recursive constructions for \(P(\Sigma^ i_ n)\), \(i=1,2,3\), are given, and the following properties are proved among other things: \(P(\Sigma^ 1_ n)\) is rank symmetric and rank unimodal, \(P(\Sigma^ i_ n)\) are lattices, \(i=2\), 3, \(P(\Sigma^ 2_ n)\) is supersolvable, \(P(\Sigma^ 3_ n)\) is edgewise lexicographically shellable. The Zeta polynomial of \(P(\Sigma^ 2_ n)\) and of \(P(\Sigma^ 3_ n)\) equals \((1-t)^{-n- 1}\cdot t\cdot \sum_{j\geq 0}C_{n-j}\left( \begin{matrix} n-j\\ j\end{matrix} \right)(t-1)^ j\), where \(C_ k\) is the kth Catalan number. The characteristic polynomial of \(P(\Sigma^ 2_ k)\) and of \(P(\Sigma^ 3_ n)\) equals \(t^{n-2}(t-1)(t-n+1)\).