We consider the permutation \(f\) of antichains of a ranked poset \(P\), moving the set of lower units of any monotone boolean function on \(P\) to the set of its upper zeros. A duality relation on orbits of this permutation is found, which is used for proving a conjecture by M. Deza and K. Fukuda.
β¦ LIBER β¦
Maximum-sized antichains in minimal posets
β Scribed by K. M. Koh
- Publisher
- Springer
- Year
- 1985
- Tongue
- English
- Weight
- 459 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Orbits of Antichains in Ranked Posets
β
D.G. Fon-Der-Flaass
π
Article
π
1993
π
Elsevier Science
π
English
β 149 KB
The convex hull of antichains in posets
β
P. Frankl
π
Article
π
1992
π
Springer-Verlag
π
English
β 181 KB
How To Split Antichains In Infinite Pose
β
PΓ©ter L. ErdΕs; Lajos Soukup
π
Article
π
2007
π
Springer-Verlag
π
English
β 255 KB
Maximal sized antichains in partial orde
β
D. Kleitman; M. Edelberg; D. Lubell
π
Article
π
1971
π
Elsevier Science
π
English
β 598 KB
Abstmt. The following general theorem is proven: Given a partially ordered set and a group Gf prmu tations among itu elements which preserves the order relation, there is a set of elements no twc? c&red acalled an independpnt set, or an antichain) of maximal size which consists of mmplete orbits und
Maximum capacity with minimal size
π
Article
π
1998
π
Elsevier Science
π
English
β 118 KB
The minimum of the antichains in the fac
β
Gerard J. Chang; Fred H. Hao
π
Article
π
1987
π
Springer Netherlands
π
English
β 161 KB