We show that the well known homotopy complementation formula of Björner andWalker admits several closely related generalizations on different classes of topological posets (lattices). The utility of this technique is demonstrated on some classes of topological posets including the Grassmannian and configuration posets, G̃n(R) and expn(X) which were introduced and studied by V. Vassiliev. Among o...

It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar cover graphs, and Joret et al. proved that dimension is bounded for posets with bounded height and with cover graphs of bounded tree-width. In this paper, it ...

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...

Let P be a finite poset. We consider the hypergraph H(P ) whose vertices are the elements of P and whose edges are the maximal intervals of P . It is known that H(P ) has the König and dual König properties for the class of series-parallel posets. Here we introduce a new class which contains series-parallel posets and for which the dual König property is satisfied. For the class of N-free poset...

If a posets lacks joins of directed subsets, one can pass to its ideal completion. But doing this means also changing the setting: The universal property of ideal completion of posets suggests that it should be regarded as a functor from the category of posets with monotone maps to the category of dcpos with Scott-continuous functions as morphisms. The same applies for the quantitative version ...

The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gallai's decomposition of a poset allows for a simple formula to count the number of the distinct minimal realizations of the posets of dimension 2. As an easy consequence, the characterization of M. El-Zahar and of N.W. S...

in this paper we study the notions of cogenerator and subdirectlyirreducible in the category of s-poset. first we give somenecessary and sufficient conditions for a cogenerator $s$-posets.then we see that under some conditions, regular injectivityimplies generator and cogenerator. recalling birkhoff'srepresentation theorem for algebra, we study subdirectlyirreducible s-posets and give this theo...

A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3 + 1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated (3+1)-free posets in the graded case by decomposing them into bipartite graphs, but until now the general enumeration problem has remained open. We give a f...

The dualization problem on arbitrary posets is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which output quasi-polynomial time algorithms exist. We introduce convex embedding and poset refle...

In 2001, S. Bulman-Fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts $A_{S}$ over a monoid $S$ that can be described by means of when the functor $A_{S} otimes -$ preserves pullbacks. In this paper, we extend these results to $S$-posets and present equivalent descriptions of weakly kernel p...