If S, T are stationary subsets of a regular uncountable cardinal κ, we say that S reflects fully in T , S < T , if for almost all α ∈ T (except a nonstationary set) S ∩ α is stationary in α. This relation is known to be a well-founded partial ordering. We say that a given poset P is realized by the reflection ordering if there is a maximal antichain 〈Xp; p ∈ P 〉 of stationary subsets of Reg(κ) ...

A recent result of Balandraud shows that for every subset S of an abelian group G there exists a non trivial subgroup H such that |TS| ≤ |T |+ |S| − 2 holds only if H ⊂ Stab(TS). Notice that Kneser’s Theorem only gives {0} 6= Stab(TS). This strong form of Kneser’s theorem follows from some nice properties of a certain poset investigated by Balandraud. We consider an analogous poset for nonabeli...

Let Bn be the poset generated by the subsets of [n] with the inclusion as relation and let P be a nite poset. We want to embed P into Bn as many times as possible such that the subsets in di erent copies are incomparable. The maximum number of such embeddings is asymptotically determined for all nite posets P as 1 t(P ) ( n bn/2c ) , where t(P ) denotes the minimal size of the convex hull of a ...

Empty p0 p2 . . . pξ pξ+2 . . . Nonempty p1 p3 . . . pξ+1 pξ+3 . . . where pξ, ξ < α, is descending in P and Nonempty wins the game of length α if he can play α times. A poset P is called weakly α-game-closed if Player Nonempty has a winning strategy in the Banach-Mazur game of length α, where Nonempty is allowed to play at limit stages. P is called strongly α-game-closed if Player Nonempty has...

Building everything from scratch, we give another proof of Propp and Roby’s theorem saying that the average antichain size in any reverse operator orbit of the poset [m] × [n] is mn m+n . It is conceivable that our method should work for other situations. As a demonstration, we show that the average size of antichains in any reverse operator orbit of [m] ×Kn−1 equals 2mn m+2n−1 . Here Kn−1 is t...

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.

In this paper, the poset $BX$ of formal balls is studied in fuzzy partial metric space $(X,p,*)$. We introduce the notion of layered complete fuzzy partial metric space and get that the poset $BX$ of formal balls is a dcpo if and only if $(X,p,*)$ is layered complete fuzzy partial metric space.

Stone space partitions $$\{X_{p}\mid p\in P\}$$ satisfying conditions like $$\overline{X_{p}}=\bigcup _{q\leqslant p}X_{q}$$ for all $$p\in P$$ , where P is a poset or PO system (poset with distinguished subset), arise naturally in the study both of primitive Boolean algebras and $$\omega $$ -categorical structures. A key concept studying such that p-trim open set which meets precisely those $$...

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...

Poset games are two-player impartial combinatorial games, with normal play convention. Starting with any poset, the players take turns picking an element of the poset, and removing that and all larger elements from the poset. Examples of poset games include Chomp, Nim, Hackendot, Subset-Takeaway, and others. We prove a general theorem about poset games, which we call the Poset Game Perioidicity...