论文信息 - On the number of minimal completely separating systems and antichains in a Boolean lattice

On the number of minimal completely separating systems and antichains in a Boolean lattice

An (n)completely separating system C ((n)CSS) is a collection of blocks of [n] = {1,..., n} such that for all distinct a, b ∈ [n] there are blocks A, B ∈C with a ∈ A \ B and b ∈ B \ A. An (n)CSS is minimal if it contains the minimum possible number of blocks for a CSS on [n]. The number of non-isomorphic minimal (n)CSSs is determined for 11 ≤ n ≤ 35. This also provides an enumeration of a natural class of antichains.

[1] Mao-cheng Cai,et al. On a problem of Katona on minimal completely separating systems with restrictions , 1984, Discrete Mathematics.

[2] Cai Mao-cheng. On a problem of Katona on minimal completely separating systems with restrictions , 1984 .

[3] K. Engel. Sperner Theory , 1996 .

[4] Donald L. Kreher,et al. Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[5] T. J. Dickson. On a problem concerning separating systems of a finite set , 1969 .

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

[7] Joel Spencer,et al. Minimal completely separating systems , 1970 .

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

[9] Ian T. Roberts,et al. Minimal (n) and (n, h, k) Completely Separating Systems , 2005, Australas. J Comb..