Connected order ideals and P-partitions

From MaRDI portal
(Redirected from Publication:1753036)
Connected order ideals and \(P\)-partitions




Abstract: Given a finite poset P, we associate a simple graph denoted by GP with all connected order ideals of P as vertices, and two vertices are adjacent if and only if they have nonempty intersection and are incomparable with respect to set inclusion. We establish a bijection between the set of maximum independent sets of GP and the set of P-forests, introduced by F'eray and Reiner in their study of the fundamental generating function FP(extbfx) associated with P-partitions. Based on this bijection, in the cases when P is naturally labeled we show that FP(extbfx) can factorise, such that each factor is a summation of rational functions determined by maximum independent sets of a connected component of GP. This approach enables us to give an alternative proof for F'eray and Reiner's nice formula of FP(extbfx) for the case of P being a naturally labeled forest with duplications. Another consequence of our result is a product formula to compute the number of linear extensions of P.





Describes a project that uses

Uses Software





This page was built for publication: Connected order ideals and \(P\)-partitions

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