Many results about the homotopy type of posets can be conveniently proved using one topological theorem due to Quillen. This paper contains a proof of that theorem and several applications. Also included is a purely combinatorial theorem which is closely related to Quillen's theorem and which generalizes Rota's Galois connection theorem
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
We study the enumerative properties of partially ordered sets, or posets. Specifically, we study fla...
Many results about the homotopy type of posets can be conveniently proved using one topological theo...
AbstractA theorem of McCord of 1966 and Quillenʼs Theorem A of 1973 provide sufficient conditions fo...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
AbstractFor any poset P let J(P) denote the complete lattice of order ideals in P. J(P) is a contrav...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
A partially ordered set (poset) is a set along with an associated partial order. Homology is a metho...
In the context of combinatorial reciprocity, it is a natural question to ask what “- Q” is for a pos...
AbstractTo any finite poset P we associate two graphs which we denote by Ω(P) and ℧(P). Several stan...
We use a classical result of McCord and reduction methods of finite spaces to prove a generalization...
A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, ant...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
AbstractWe give a new formula for the number of order-preserving maps from a finite poset Q to a fin...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
We study the enumerative properties of partially ordered sets, or posets. Specifically, we study fla...
Many results about the homotopy type of posets can be conveniently proved using one topological theo...
AbstractA theorem of McCord of 1966 and Quillenʼs Theorem A of 1973 provide sufficient conditions fo...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
AbstractFor any poset P let J(P) denote the complete lattice of order ideals in P. J(P) is a contrav...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
A partially ordered set (poset) is a set along with an associated partial order. Homology is a metho...
In the context of combinatorial reciprocity, it is a natural question to ask what “- Q” is for a pos...
AbstractTo any finite poset P we associate two graphs which we denote by Ω(P) and ℧(P). Several stan...
We use a classical result of McCord and reduction methods of finite spaces to prove a generalization...
A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, ant...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
AbstractWe give a new formula for the number of order-preserving maps from a finite poset Q to a fin...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
We study the enumerative properties of partially ordered sets, or posets. Specifically, we study fla...