To every partially ordered set (poset), one can associate a generating function, known as the P-partition generating function. We find necessary conditions and sufficient conditions for two posets to have the same P-partition generating function. We define the notion of a jump sequence for a labeled poset and show that having equal jumpsequences is a necessary condition for generating function equality. We also develop multiple ways of modifying posets that preserve generating function equality. Finally, we are able to give a complete classification of equalities among partially ordered setswith exactly two linear extensions
AbstractMany of the well-known selection and sorting problems can be understood as the production of...
In this thesis we explore extremal, structural, and algorithmic problems involving the partitioning ...
AbstractWe study the posets (partially ordered sets) Pn of partitions of an integer n, ordered by re...
We find necessary and separate sufficient conditions for the difference between two labeled partiall...
Abstract. To every labeled poset (P, ω), one can associate a quasisymmetric generating function for ...
To every labeled poset (P, omega), one can associate a quasisymmetric generating function for its (P...
To every labeled poset (P, omega), one can associate a quasisymmetric generating function for its (P...
To every labeled poset (P, omega), one can associate a quasisymmetric generating function for its (P...
One question relating to partially ordered sets (posets) is that of partitioning or dividing the pos...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
AbstractUsing the inclusion–exclusion principle, we derive a formula of generating functions for P-p...
AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusi...
An acyclic directed graph can be viewed as a (labelled) poset (P,ω). To the latter, one can...
AbstractUsing the inclusion–exclusion principle, we derive a formula of generating functions for P-p...
AbstractMany of the well-known selection and sorting problems can be understood as the production of...
In this thesis we explore extremal, structural, and algorithmic problems involving the partitioning ...
AbstractWe study the posets (partially ordered sets) Pn of partitions of an integer n, ordered by re...
We find necessary and separate sufficient conditions for the difference between two labeled partiall...
Abstract. To every labeled poset (P, ω), one can associate a quasisymmetric generating function for ...
To every labeled poset (P, omega), one can associate a quasisymmetric generating function for its (P...
To every labeled poset (P, omega), one can associate a quasisymmetric generating function for its (P...
To every labeled poset (P, omega), one can associate a quasisymmetric generating function for its (P...
One question relating to partially ordered sets (posets) is that of partitioning or dividing the pos...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
AbstractUsing the inclusion–exclusion principle, we derive a formula of generating functions for P-p...
AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusi...
An acyclic directed graph can be viewed as a (labelled) poset (P,ω). To the latter, one can...
AbstractUsing the inclusion–exclusion principle, we derive a formula of generating functions for P-p...
AbstractMany of the well-known selection and sorting problems can be understood as the production of...
In this thesis we explore extremal, structural, and algorithmic problems involving the partitioning ...
AbstractWe study the posets (partially ordered sets) Pn of partitions of an integer n, ordered by re...