Decompositions of Bn and Πn using symmetric chains

D. Loeb; E. Damiani; O. D'Antona

doi:10.1016/0097-3165(94)90042-6

Decompositions of B_n and Π_n using symmetric chains

D. Loeb, E. Damiani, O. D'Antona

Electrical Engineering

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of B_n, and explain how it can be used to find a maximal collection of disjoint symmetric chains in the nonsymmetric lattice of partitions of a set.

Original language	British English
Pages (from-to)	151-157
Number of pages	7
Journal	Journal of Combinatorial Theory, Series A
Volume	65
Issue number	1
DOIs	https://doi.org/10.1016/0097-3165(94)90042-6
State	Published - Jan 1994

Access to Document

10.1016/0097-3165(94)90042-6

Cite this

@article{f71526af04bd4194be14e2dff2fd0e29,

title = "Decompositions of Bn and Πn using symmetric chains",

abstract = "We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of Bn, and explain how it can be used to find a maximal collection of disjoint symmetric chains in the nonsymmetric lattice of partitions of a set.",

author = "D. Loeb and E. Damiani and O. D'Antona",

year = "1994",

month = jan,

doi = "10.1016/0097-3165(94)90042-6",

language = "British English",

volume = "65",

pages = "151--157",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Decompositions of Bn and Πn using symmetric chains

AU - Loeb, D.

AU - Damiani, E.

AU - D'Antona, O.

PY - 1994/1

Y1 - 1994/1

N2 - We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of Bn, and explain how it can be used to find a maximal collection of disjoint symmetric chains in the nonsymmetric lattice of partitions of a set.

AB - We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of Bn, and explain how it can be used to find a maximal collection of disjoint symmetric chains in the nonsymmetric lattice of partitions of a set.

UR - http://www.scopus.com/inward/record.url?scp=38149145765&partnerID=8YFLogxK

U2 - 10.1016/0097-3165(94)90042-6

DO - 10.1016/0097-3165(94)90042-6

M3 - Article

AN - SCOPUS:38149145765

SN - 0097-3165

VL - 65

SP - 151

EP - 157

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 1

ER -

Decompositions of B_n and Π_n using symmetric chains

Abstract

Access to Document

Other files and links

Fingerprint

Cite this