The notion of a $D$-poset was introduced in a connection withquantum mechanical models. In this paper, we introduce theconditional expectation of  random variables on theK^{o}pka's $D$-Poset and prove the basic properties ofconditional expectation on this  structure.

the notion of a $d$-poset was introduced in a connection withquantum mechanical models. in this paper, we introduce theconditional expectation of  random variables on thek^{o}pka's $d$-poset and prove the basic properties ofconditional expectation on this  structure.

the notion of a $d$-poset was introduced in a connection withquantum mechanical models. in this paper, we introduce theconditional expectation of  random variables on thek^{o}pka's $d$-poset and prove the basic properties ofconditional expectation on this  structure.

The notation and terminology used here are introduced in the following papers: [18], [13], [17], [14], [19], [7], [1], [8], [6], [20], [3], [9], [2], [10], [15], [16], [5], [11], [4], and [12]. Let us observe that there exists a lattice which is finite. Let us mention that every lattice which is finite is also complete. Let L be a lattice and let D be a subset of the carrier of L. The functor D...

We study observables as r-D-homomorphisms de®ned on Boolean D-posets of subsets into a Boolean Dposet. We show that given an atomic r-complete Boolean D-poset P with the countable set of atoms there exist a r-complete Boolean D-poset of subsets S and a r-D-homomorphism h from S onto P, more precisely we can choose S ˆ B…R†, which gives an analogy of the Loomis± Sikorski representation theorem f...

The dimension of a poset P , denoted dim(P ), is the least positive integer d for which P is the intersection of d linear extensions of P . The maximum dimension of a poset P with |P | ≤ 2n+ 1 is n, provided n ≥ 2, and this inequality is tight when P contains the standard example Sn. However, there are posets with large dimension that do not contain the standard example S2. Moreover, for each f...

The purpose of this paper is to present an algorithm which generates linear extensions for a non-simplylaced d-complete poset with uniform probability. Résumé. Le but de ce papier est présenter un algorithme qui produit des extensions linéaires pour une non-simplylaced d-complete poset avec probabilité constante.

In recent years, researchers have shown renewed interest in combinatorial properties of posets determined by geometric properties of its order diagram and topological properties of its cover graph. In most cases, the roots for the problems being studied today can be traced back to the 1970’s, and sometimes even earlier. In this paper, we study the problem of bounding the dimension of a planar p...

We consider a simplicial complex generaliztion of a result of Billera and Meyers that every nonshellable poset contains the smallest nonshellable poset as an induced subposet. We prove that every nonshellable 2-dimensional simplicial complex contains a nonshellable induced subcomplex with less than 8 vertices. We also establish CL-shellability of interval orders and as a consequence obtain a fo...