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 β¦
Orbits of antichains revisited
β Scribed by P.J Cameron; D.G Fon-Der-Flaass
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 472 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0195-6698
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 lunar orbit revisited, III
β
FranΓ§ois Mignard
π
Article
π
1981
π
Springer Netherlands
π
English
β 894 KB
Traces of antichains
β
P. Frankl
π
Article
π
1989
π
Springer Japan
π
English
β 227 KB
Flattening Antichains
β
Γkos KisvΓΆlcsey
π
Article
π
2006
π
Springer-Verlag
π
English
β 221 KB
Antichain sequences
β
Kathie Cameron
π
Article
π
1985
π
Springer Netherlands
π
English
β 378 KB
Antichain cutsets
β
Ivan Rival; Nejib Zaguia
π
Article
π
1985
π
Springer Netherlands
π
English
β 523 KB
A subset A of an ordered set P is a cutset if each maximal chain of P meetsA ; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a 'forbidden configuration', of those finite ordered sets, which can be expressed as the union of ant