|
|
A326950
|
|
Number of T_0 antichains of nonempty subsets of {1..n}.
|
|
7
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The dual of a set-system has, for each vertex, one edge consisting of the indices (or positions) of the edges containing that vertex. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. The T_0 condition means that the dual is strict (no repeated edges).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(0) = 1 through a(3) = 12 antichains:
{} {} {} {}
{{1}} {{1}} {{1}}
{{2}} {{2}}
{{1},{2}} {{3}}
{{1},{2}}
{{1},{3}}
{{2},{3}}
{{1,2},{1,3}}
{{1,2},{2,3}}
{{1},{2},{3}}
{{1,3},{2,3}}
{{1,2},{1,3},{2,3}}
|
|
MATHEMATICA
|
dual[eds_]:=Table[First/@Position[eds, x], {x, Union@@eds}];
stableQ[u_, Q_]:=!Apply[Or, Outer[#1=!=#2&&Q[#1, #2]&, u, u, 1], {0, 1}];
Table[Length[Select[Subsets[Subsets[Range[n], {1, n}]], stableQ[#, SubsetQ]&&UnsameQ@@dual[#]&]], {n, 0, 3}]
|
|
CROSSREFS
|
Antichains of nonempty sets are A014466.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|