symmetric chain decomposition

symmetric chain decomposition

[sə¦me·trik ¦chān dē‚käm·pə′zish·ən]
(mathematics)
A partition of the set of all subsets of a finite set, X, into symmetric chains in X.
References in periodicals archive ?
However, O'Hara's construction does not give a symmetric chain decomposition of the poset L(l, m) of partitions which fit the l x m rectangle (in other words, the difference between successive partitions is not always a corner).
5, which might lead to a way of finding a symmetric chain decomposition of the poset L(m, l) mentioned above.
On the other hand, cases l = 3, 4 have been studied in [Lin, W] using an explicit symmetric chain decomposition.