论文信息 - Decompositions of Bn and PIn Using Symmetric Chains - 字舞流文

Decompositions of Bn and PIn Using Symmetric Chains

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.

Ernesto Damiani | Ottavio M. D'Antona | D. Loeb

[1] E. Sperner. Ein Satz über Untermengen einer endlichen Menge , 1928 .

[2] J. Spencer. A Generalized Rota Conjecture for Partitions , 1974 .

[3] Neil White,et al. Partitions into chains of a class of partially ordered sets , 1978 .

[4] James B. Shearer,et al. A simple counterexample to a conjecture of Rota , 1979, Discret. Math..

[5] de Ng Dick Bruijn,et al. On the set of divisors of a number , 1951 .

[6] Daniel J. Kleitman,et al. Strong Versions of Sperner's Theorem , 1976, J. Comb. Theory, Ser. A.

[7] G. Naldi,et al. On the Connection Constants , 1991 .

[8] G. Rota,et al. Combinatorial Structure of the Faces of the n-Cube , 1978 .

[9] Jerrold R. Griggs,et al. Sufficient Conditions for a Symmetric Chain Order , 1977 .

[10] E. Rodney Canfield. On a problem of rota , 1978 .

[11] Daniel J. Kleitman,et al. Superantichains in the Lattice of Partitions of a Set , 1984 .

[12] Hunter S. Snevily. Combinatorics of finite sets , 1991 .