The Poset Conjecture is that for any labelled poset (P, ω), a certain polynomial related to the order polynomial of (P, ω) has only real (non-positive) zeros. These polynomials occur naturally in a wide variety of combinatorial and algebraic enumeration problems. We obtain product and composition theorems which suffice to verify the conjecture for series-parallel labelled posets and for labelled forests
Abstract. A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 an...
Abstract. A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 an...
Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. ...
AbstractWe investigate the Tutte polynomial f(P; t, z) of a series-parallel partially ordered set P....
We study the enumerative properties of partially ordered sets, or posets. Specifically, we study fla...
AbstractWe investigate the Tutte polynomial of a greedoid associated to a partially ordered set. In ...
Abstract. Pólya’s enumeration theorem states that the number of labelings of a finite set up to symm...
AbstractWe give a new formula for the number of order-preserving maps from a finite poset Q to a fin...
AbstractWe investigate the Tutte polynomial of a greedoid associated to a partially ordered set. In ...
AbstractFor any finite poset P and any integer k⩾0, let αk(P) denote the number of k-chains (i.e. ch...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
There are a multitude of ways to generate symmetric functions, many of which have been described pre...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
AbstractWe present an elementary method for proving enumeration formulas which are polynomials in ce...
Abstract. A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 an...
Abstract. A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 an...
Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. ...
AbstractWe investigate the Tutte polynomial f(P; t, z) of a series-parallel partially ordered set P....
We study the enumerative properties of partially ordered sets, or posets. Specifically, we study fla...
AbstractWe investigate the Tutte polynomial of a greedoid associated to a partially ordered set. In ...
Abstract. Pólya’s enumeration theorem states that the number of labelings of a finite set up to symm...
AbstractWe give a new formula for the number of order-preserving maps from a finite poset Q to a fin...
AbstractWe investigate the Tutte polynomial of a greedoid associated to a partially ordered set. In ...
AbstractFor any finite poset P and any integer k⩾0, let αk(P) denote the number of k-chains (i.e. ch...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
There are a multitude of ways to generate symmetric functions, many of which have been described pre...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
AbstractWe present an elementary method for proving enumeration formulas which are polynomials in ce...
Abstract. A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 an...
Abstract. A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 an...
Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. ...