نتایج جستجو برای: order dense sub s poset

تعداد نتایج: 1779601  

Journal: :Order 2015
Gyula O. H. Katona Dániel T. Nagy

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

Journal: :Math. Log. Q. 2004
Bernhard König Yasuo Yoshinobu

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

Journal: :Electr. J. Comb. 2017
Chao-Ping Dong Suijie Wang

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

Journal: :Discrete Mathematics 2016
Jason P. Smith

The set of all permutations, ordered by pattern containment, is a poset. We present an order isomorphism from the poset of permutations with a fixed number of descents to a certain poset of words with subword order. We use this bijection to show that intervals of permutations with a fixed number of descents are shellable, and we present a formula for the Möbius function of these intervals. We p...

Journal: :Discrete Mathematics 1987
William T. Trotter Douglas B. West

A t-box representation of a graph encodes each vertex as a box in t-space determined by the (integer) coordinates of its lower and upper corner, such that vertices are adjacent if and only if the corresponding boxes intersect. The boxicity of a graph G is the minimum t for which this can be done; equivalently, it is the minimum t such that G can be expressed as the intersection graph of interva...

Journal: :The Review of Laser Engineering 1974

2009
Stéphane Launois

Let n be a positive integer greater than or equal to 2, and q ∈ C transcendental over Q. In this paper, we give an algorithmic construction of an ordered bijection between the set of H-primes of Oq (Mn(C)) and the sub-poset S of the (reverse) Bruhat order of the symmetric group S2n consisting of those permutations that move any integer by no more than n positions. Further, we describe the permu...

2007
Josef Urban

Let R be a non empty poset. One can verify that there exists an order sorted set of R which is binary relation yielding. Let R be a non empty poset, let A, B be many sorted sets indexed by the carrier of R, and let I1 be a many sorted relation between A and B. We say that I1 is os-compatible if and only if the condition (Def. 1) is satisfied. (Def. 1) Let s1, s2 be elements of the carrier of R....

Journal: :algebraic structures and their applications 2014
ramin kazemi

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.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید