Hierarchical data, such as Partially Ordered Set (POSET) is tremendously used in relational databases, especially in data mining and data warehouse based-applications. Unfortunately, SQL (Structured Query Language) does not effectively support hierarchical data structure to manage this sort of data, for example, in Oracle, a CONNECT BY operator is used to query data organized into trees, howeve...

Let SN(P) be the poset obtained by adding a dummy vertex on each diagonal edge of the N’s of a finite poset P. We show that SN(SN(P)) is N-free. It follows that this poset is the smallest N-free barycentric subdivision of the diagram of P, poset whose existence was proved by P.A. Grillet. This is also the poset obtained by the algorithm starting with P0 := P and consisting at step m of adding a...

Let V be an n-dimensional vector space over a finite field Fq and P = {1, 2, . . . , n} a poset. We consider on V the poset-metric dP . In this paper, we give a complete description of groups of linear isometries of the metric space (V, dP ), for any poset-metric dP . We show that a linear isometry induces an automorphism of order in poset P , and consequently we show the existence of a pair of...

We generalize the notion of the rank-generating function of a graded poset. Namely, by enumerating different chains in a poset, we can assign a quasi-symmetric function to the poset. This map is a Hopf algebra homomorphism between the reduced incidence Hopf algebra of posets and the Hopf algebra of quasi-symmetric functions. This work implies that the zeta polynomial of a poset may be viewed in...

We study properties of a poset generating a Cohen-Macaulay algebra with straightening laws (ASL for short). We show that if a poset P generates a Cohen-Macaulay ASL, then P is pure and, if P is moreover Buchsbaum, then P is Cohen-Macaulay. Some results concerning a Rees algebra of an ASL defined by a straightening closed ideal are also established. And it is shown that if P is a Cohen-Macaulay ...

In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...

A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the labels along the other set yields a linear extension of the poset. The linear extension yielded by thus twice sorting a labeled nonmessing-up poset may be independent of which sort was performed fi...

The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n− 1)-dimensional spheres. The number of these spheres is the boole...

In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...

In this paper, concepts of strongly way below relations, completely precontinuous posets, coprimes and Heyting posets are introduced. The main results are: (1) The strongly way below relations of completely precontinuous posets have the interpolation property; (2) A poset P is a completely precontinuous poset iff its normal completion is a completely distributive lattice; (3) An ω-chain complet...