Shellability of sparse order complexes
Let \(P\) be a finite graded poset of rank \(n\) with order relation \(<_P\) and rank function \(\rho: P \rightarrow \mathbb{Z}\). This paper concerns a generalization of the order complex of \(P\) called the \(k\)-sparse order complex for any integer \(k \geq 1\).NEWLINENEWLINEIn the classical setting, the order complex \(\Delta(P)\) is the simplicial complex whose vertices correspond to the elements of \(P\) and whose faces correspond to chains of elements \(x_1 <_P x_2 <_P \cdots <_P x_t\) in \(P\). The \(k\)-sparse order complex of \(P\) is the sub complex of \(\Delta(P)\) whose faces correspond to all chains \(x_1 <_P x_2 <_P \cdots <_P x_t\) with the added requirement that \(\rho(x_{i+1}) - \rho(x_i) \geq k\) for all \(i\). Thus the standard order complex \(\Delta(P)\) corresponds to the \(1\)-sparse order complex \(\Delta^1(P)\).NEWLINENEWLINEThe main result of this paper shows that if \(\Delta(P)\) is a shellable simplicial complex (even in the non-pure setting, as defined by \textit{A. Björner} and \textit{M. L. Wachs} [Trans. Am. Math. Soc. 348, No. 4, 1299--1327 (1996; Zbl 0857.05102); ibid. 349, No. 10, 3945--3975 (1997; Zbl 0886.05126)]), then so is \(\Delta^{k}(P)\) for any \(k\). Moreover, a combinatorial interpretation of the \(h\)-numbers of \(\Delta^k(P)\) is given in terms of the shelling.
This page was built for publication: Shellability of sparse order complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853567)
