The Möbius function of generalized subword order

From MaRDI portal



Abstract: Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u leq w if and only if there is a subword u' of w having the same length as u such that each element of u is less than or equal to the corresponding element of u' in the partial order on P. Classical subword order arises when P is an antichain, while letting P be a chain gives an order on compositions. For any finite poset P, we give a simple formula for the Mobius function of P* in terms of the Mobius function of P. This permits us to rederive in a easy and uniform manner previous results of Bjorner, Sagan and Vatter, and Tomie. We are also able to determine the homotopy type of all intervals in P* for any finite P of rank at most 1.


Given a finite poset \(P\), denote by \(P^*\) the set of all finite-length words on \(P\). The generalized subword order on \(P^*\) is defined by \(u\leq w\) if and only if there is a subword \(u'\) of \(w\) having the same length as \(u\) such that each element of \(u\) is less than or equal to the corresponding element of \(u'\) in \(P\). Note that this coincides with the classical subword order when \(P\) is discrete (i.e. an antichain).NEWLINENEWLINEThe authors prove a simple formula for the Möbius function of \(P^*\) in terms of the Möbius function of \(P\). They also derive various applications of this result: they determine the homotopy type of all intervals of \(P^*\) for any finite poset \(P\) of rank at most \(1\) and obtain alternative proofs of previous results of Björner, Sagan and Vatter, and Tomie.











This page was built for publication: The Möbius function of generalized subword order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409623)