A326881 -id:A326881 - cp's OEIS frontend

A326944 Number of T_0 sets of subsets of {1..n} that cover all n vertices, contain {}, and are closed under intersection.

1, 1, 4, 58, 3846, 2685550, 151873991914, 28175291154649937052

Offset: 0

Gus Wiseman, Aug 08 2019

The dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks 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).

			The a(0) = 1 through a(2) = 4 sets of subsets:
  {{}}  {{},{1}}  {{},{1},{2}}
                  {{},{1},{1,2}}
                  {{},{2},{1,2}}
                  {{},{1},{2},{1,2}}

The version not closed under intersection is A059201.
The non-T_0 version is A326881.
The version where {} is not necessarily an edge is A326943.
Cf. A003181, A003465, A055621, A182507, A245567, A316978, A319564, A326906, A326939, A326941, A326945, A326947.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
Table[Length[Select[Subsets[Subsets[Range[n]]],MemberQ[#,{}]&&Union@@#==Range[n]&&UnsameQ@@dual[#]&&SubsetQ[#,Intersection@@@Tuples[#,2]]&]],{n,0,3}]

a(n) = Sum_{k=0..n} Stirling1(n,k)*A326881(k). - Andrew Howroyd, Aug 14 2019

a(5)-a(7) from Andrew Howroyd, Aug 14 2019

A309615 Number of T_0 set-systems covering n vertices that are closed under intersection.

Original entry on oeis.org

1, 1, 2, 12, 232, 19230, 16113300, 1063117943398, 225402329237199496416

Offset: 0

Gus Wiseman, Aug 11 2019

First differs from A182507 at a(5) = 19230, A182507(5) = 12848.

A set-system is a finite set of finite nonempty sets. 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).

			The a(0) = 1 through a(3) = 12 set-systems:
  {}  {{1}}  {{1},{1,2}}  {{1},{1,2},{1,3}}
             {{2},{1,2}}  {{2},{1,2},{2,3}}
                          {{3},{1,3},{2,3}}
                          {{1},{1,2},{1,2,3}}
                          {{1},{1,3},{1,2,3}}
                          {{2},{1,2},{1,2,3}}
                          {{2},{2,3},{1,2,3}}
                          {{3},{1,3},{1,2,3}}
                          {{3},{2,3},{1,2,3}}
                          {{1},{1,2},{1,3},{1,2,3}}
                          {{2},{1,2},{2,3},{1,2,3}}
                          {{3},{1,3},{2,3},{1,2,3}}

The version with empty edges allowed is A326943.

Cf. A003465, A059052, A059201, A319637, A326880, A326881, A326901, A326902, A326905, A326944, A326945.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
Table[Length[Select[Subsets[Subsets[Range[n],{1,n}]],Union@@#==Range[n]&&UnsameQ@@dual[#]&&SubsetQ[#,Intersection@@@Tuples[#,2]]&]],{n,0,3}]

a(n) = A326943(n) - A326944(n).
a(n) = Sum_{k = 1..n} s(n,k) * A326901(k - 1) where s = A048994.
a(n) = Sum_{k = 1..n} s(n,k) * A326902(k) where s = A048994.

A326907 Number of non-isomorphic sets of subsets of {1..n} that are closed under union and cover all n vertices. First differences of A193675.

Original entry on oeis.org

2, 2, 6, 28, 330, 28960, 216562364, 5592326182940100

Offset: 0

Gus Wiseman, Aug 03 2019

Differs from A108800 in having a(0) = 2 instead of 1.

			Non-isomorphic representatives of the a(0) = 2 through a(3) = 28 sets of sets:
  {}    {{1}}    {{12}}          {{123}}
  {{}}  {{}{1}}  {{}{12}}        {{}{123}}
                 {{2}{12}}       {{3}{123}}
                 {{}{2}{12}}     {{23}{123}}
                 {{1}{2}{12}}    {{}{3}{123}}
                 {{}{1}{2}{12}}  {{}{23}{123}}
                                 {{1}{23}{123}}
                                 {{3}{23}{123}}
                                 {{13}{23}{123}}
                                 {{}{1}{23}{123}}
                                 {{}{3}{23}{123}}
                                 {{}{13}{23}{123}}
                                 {{2}{3}{23}{123}}
                                 {{2}{13}{23}{123}}
                                 {{3}{13}{23}{123}}
                                 {{12}{13}{23}{123}}
                                 {{}{2}{3}{23}{123}}
                                 {{}{2}{13}{23}{123}}
                                 {{}{3}{13}{23}{123}}
                                 {{}{12}{13}{23}{123}}
                                 {{2}{3}{13}{23}{123}}
                                 {{3}{12}{13}{23}{123}}
                                 {{}{2}{3}{13}{23}{123}}
                                 {{}{3}{12}{13}{23}{123}}
                                 {{2}{3}{12}{13}{23}{123}}
                                 {{}{2}{3}{12}{13}{23}{123}}
                                 {{1}{2}{3}{12}{13}{23}{123}}
                                 {{}{1}{2}{3}{12}{13}{23}{123}}

The case without empty sets is A108798.
The case with a single covering edge is A108800.
First differences of A193675.
The case also closed under intersection is A326898 for n > 0.
The labeled version is A326906.
The same for union instead of intersection is (also) A326907.
Cf. A001930, A102895, A108798, A193674, A193675, A326880, A326881, A326883, A326898, A326908.

a(7) added from A108800 by Andrew Howroyd, Aug 10 2019

cp's OEIS Frontend

A326944 Number of T_0 sets of subsets of {1..n} that cover all n vertices, contain {}, and are closed under intersection.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A309615 Number of T_0 set-systems covering n vertices that are closed under intersection.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A326907 Number of non-isomorphic sets of subsets of {1..n} that are closed under union and cover all n vertices. First differences of A193675.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions