In this paper we attempt to find and investigate the most general class of posets which satisfy a properly generalized version of the Hofmann-Mislove theorem. For that purpose, we generalize and study some notions (like compactness, the Scott topology, Scott open filters, prime elements, the spectrum etc.), and adjust them for use in general posets instead of frames. Then we characterize the po...

The closure of the convex cone generated by all flag f -vectors of graded posets is shown to be polyhedral. In particular, we give the facet inequalities to the polar cone of all nonnegative chain-enumeration functionals on this class of posets. These are in one-to-one correspondence with antichains of intervals on the set of ranks and thus are counted by Catalan numbers. Furthermore, we prove ...

We introduce a new type of dcpo-completion of posets, called D-completion. For any poset P , the D-completion exists, and P and its Dcompletion have the isomorphic Scott closed set lattices. This completion is idempotent. A poset P is continuous (algebraic) if and only if its D-completion is continuous(algebraic). Using the D-completion, we construct the local dcpocompletion of posets, that rev...

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset with a nontrivial non-Hausdorff topology. Their ability to reproduce important topological information of the continuum has been the main motivation for the...

We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the Möbius function and topology of such pattern posets. We prove our results using a poset fibration based on the embeddings of the poset, where embeddings are representations of occurrences. We show that the Möbius ...

Stanely, R.P., f-vectors and h-vectors of simplicial posets, Journal of Pure and Applied Algebra 71 (1991) 319-331. A simplicial poset is a (finite) poset P with d such that every interval [6, x] is a boolean algebra. Simplicial posets are generalizations of simplicial complexes. The f-vector f(P) = (f,, f,, , ,f_,) of a simplicial poset P of rank d is defined by f; = #{x E P: [6, x] g B,, I}, ...

Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct representation of the poset, admitting constant response time for queries of the form “is x < y?”. This application motivates looking for stronger notions of dimensi...

We present a method of computing the generating function fP (x) of P -partitions of a poset P . The idea is to introduce two kinds of transformations on posets and compute fP (x) by recursively applying these transformations. As an application, we consider the partially ordinal sum Pn of n copies of a given poset, which generalizes both the direct sum and the ordinal sum. We show that the seque...

Abstract It is elementary and well known that if an element x of a bounded modular lattice L $ \mathbf L has complement in then relative every interval [ , b ] containing . We show the relatively strong assumption modularity can be replaced by weaker one formulated language so-call...

The fractional weak discrepancy wdF (P ) of a poset P = (V,≺) was introduced in [5] as the minimum nonnegative k for which there exists a function f : V → R satisfying (i) if a ≺ b then f(a)+1 ≤ f(b) and (ii) if a ‖ b then |f(a) − f(b)| ≤ k. In this paper we generalize results in [6, 7] on the range of wdF for semiorders to the larger class of split semiorders. In particular, we prove that for ...