Connected order ideals and P-partitions
From MaRDI portal
Abstract: Given a finite poset , we associate a simple graph denoted by with all connected order ideals of 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 and the set of -forests, introduced by F'eray and Reiner in their study of the fundamental generating function associated with -partitions. Based on this bijection, in the cases when is naturally labeled we show that can factorise, such that each factor is a summation of rational functions determined by maximum independent sets of a connected component of . This approach enables us to give an alternative proof for F'eray and Reiner's nice formula of for the case of being a naturally labeled forest with duplications. Another consequence of our result is a product formula to compute the number of linear extensions of .
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- A historical survey of P-partitions
- Counting linear extensions
- Faces of generalized permutohedra
- Linear extension sums as valuations on cones
- Ordered structures and partitions
- Permutohedra, Associahedra, and Beyond
- p-partitions revisited
- q-hook length formulas for forests
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)