A326973 -id:A326973 - cp's OEIS frontend

A327018 Number of non-isomorphic set-systems of weight n whose dual is a weak antichain.

1, 1, 2, 3, 6, 8, 17, 24, 51, 80, 180

Offset: 0

Gus Wiseman, Aug 15 2019

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}}. A weak antichain is a multiset of sets, none of which is a proper subset of any other.

			Non-isomorphic representatives of the a(1) = 1 through a(6) = 17 multiset partitions:
  {1}  {12}    {123}      {1234}        {12345}          {123456}
       {1}{2}  {1}{23}    {1}{234}      {1}{2345}        {1}{23456}
               {1}{2}{3}  {12}{34}      {12}{345}        {12}{3456}
                          {1}{2}{12}    {1}{2}{345}      {123}{456}
                          {1}{2}{34}    {1}{23}{45}      {12}{13}{23}
                          {1}{2}{3}{4}  {1}{2}{3}{23}    {1}{23}{123}
                                        {1}{2}{3}{45}    {1}{2}{3456}
                                        {1}{2}{3}{4}{5}  {1}{23}{456}
                                                         {12}{34}{56}
                                                         {1}{2}{13}{23}
                                                         {1}{2}{3}{123}
                                                         {1}{2}{3}{456}
                                                         {1}{2}{34}{56}
                                                         {3}{4}{12}{34}
                                                         {1}{2}{3}{4}{34}
                                                         {1}{2}{3}{4}{56}
                                                         {1}{2}{3}{4}{5}{6}

Cf. A007716, A283877, A293993, A319643, A319721, A326966, A326968, A326970, A326972, A326973, A326974, A326975, A326978, A327017, A327019.

A319643 Number of non-isomorphic weight-n strict multiset partitions whose dual is an antichain of (not necessarily distinct) multisets.

Original entry on oeis.org

1, 1, 3, 6, 15, 29, 82, 179, 504, 1302, 3822

Offset: 0

Gus Wiseman, Sep 25 2018

The dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks containing that vertex, counted with multiplicity. For example, the dual of {{1,2},{2,2}} is {{1},{1,2,2}}.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.
From Gus Wiseman, Aug 15 2019: (Start)
Also the number of non-isomorphic T_0 weak antichains of weight n. The T_0 condition means that the dual is strict (no repeated edges). A weak antichain is a multiset of multisets, none of which is a proper submultiset of any other. For example, non-isomorphic representatives of the a(0) = 1 through a(4) = 15 T_0 weak antichains are:
  {}  {{1}}  {{1,1}}    {{1,1,1}}      {{1,1,1,1}}
             {{1},{1}}  {{1,2,2}}      {{1,2,2,2}}
             {{1},{2}}  {{1},{2,2}}    {{1,1},{1,1}}
                        {{1},{1},{1}}  {{1,1},{2,2}}
                        {{1},{2},{2}}  {{1},{2,2,2}}
                        {{1},{2},{3}}  {{1,2},{2,2}}
                                       {{1},{2,3,3}}
                                       {{1,3},{2,3}}
                                       {{1},{1},{2,2}}
                                       {{1},{2},{3,3}}
                                       {{1},{1},{1},{1}}
                                       {{1},{1},{2},{2}}
                                       {{1},{2},{2},{2}}
                                       {{1},{2},{3},{3}}
                                       {{1},{2},{3},{4}}
(End)

			Non-isomorphic representatives of the a(1) = 1 through a(4) = 15 multiset partitions:
1: {{1}}
2: {{1,1}}
   {{1,2}}
   {{1},{2}}
3: {{1,1,1}}
   {{1,2,3}}
   {{1},{1,1}}
   {{1},{2,2}}
   {{1},{2,3}}
   {{1},{2},{3}}
4: {{1,1,1,1}}
   {{1,1,2,2}}
   {{1,2,3,4}}
   {{1},{1,1,1}}
   {{1},{1,2,2}}
   {{1},{2,2,2}}
   {{1},{2,3,4}}
   {{1,1},{2,2}}
   {{1,2},{3,3}}
   {{1,2},{3,4}}
   {{1},{2},{1,2}}
   {{1},{2},{2,2}}
   {{1},{2},{3,3}}
   {{1},{2},{3,4}}
   {{1},{2},{3},{4}}

Cf. A006126, A007716, A059201, A283877, A293606, A316980, A316983, A318099, A319558, A319616-A319646.

Cf. A245567, A293993, A319721, A326704, A326950, A326973, A326978.

A327011 Number of unlabeled sets of subsets covering n vertices where every vertex is the unique common element of some subset of the edges, also called unlabeled covering T_1 sets of subsets.

Original entry on oeis.org

2, 2, 4, 32, 2424

Offset: 0

Gus Wiseman, Aug 13 2019

Alternatively, these are unlabeled sets of subsets covering n vertices whose dual is a (strict) antichain. The dual of a set of subsets 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}}. An antichain is a set of subsets where no edge is a subset of any other.

			Non-isomorphic representatives of the a(0) = 1 through a(2) = 4 sets of subsets:
  {}    {{1}}     {{1},{2}}
  {{}}  {{},{1}}  {{},{1},{2}}
                  {{1},{2},{1,2}}
                  {{},{1},{2},{1,2}}

Unlabeled covering sets of subsets are A003181.
The same with T_0 instead of T_1 is A326942.
The non-covering version is A326951 (partial sums).
The labeled version is A326960.
The case without empty edges is A326974.
Cf. A001146, A055621, A059523, A319637, A326961, A326972, A326973, A326976, A326977, A326979.

a(n) = A326974(n) / 2.

a(n > 0) = A326951(n) - A326951(n - 1).

cp's OEIS Frontend

A327018 Number of non-isomorphic set-systems of weight n whose dual is a weak antichain.

Views

Author

Keywords

Comments

Examples

Crossrefs

A319643 Number of non-isomorphic weight-n strict multiset partitions whose dual is an antichain of (not necessarily distinct) multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A327011 Number of unlabeled sets of subsets covering n vertices where every vertex is the unique common element of some subset of the edges, also called unlabeled covering T_1 sets of subsets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula