A327038 -id:A327038 - cp's OEIS frontend

A327039 Number of set-systems covering a subset of {1..n} where every two covered vertices appear together in some edge (cointersecting).

1, 2, 7, 88, 25421, 2077323118, 9221293242272922067, 170141182628636920942528022609657505092

Offset: 0

Gus Wiseman, Aug 17 2019

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. 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}}. This sequence counts set-systems that are cointersecting, meaning their dual is pairwise intersecting.

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

The unlabeled multiset partition version is A319752.
The BII-numbers of these set-systems are A326853.
The pairwise intersecting case is A327038.
The covering case is A327040.
The case where the dual is strict is A327052.
Cf. A058891, A306006, A319765, A327020, A327053.

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[dual[#],Intersection[#1,#2]=={}&]&]],{n,0,3}]

Binomial transform of A327040.

a(5)-a(7) from Christian Sievers, Oct 22 2023

A319774 Number of intersecting set systems spanning n vertices whose dual is also an intersecting set system.

Original entry on oeis.org

1, 1, 2, 14, 814, 1174774, 909125058112, 291200434263385001951232

Offset: 0

Gus Wiseman, Sep 27 2018

The dual of a multiset partition has, for each vertex, one part consisting of the indices (or positions) of the parts containing that vertex, counted with multiplicity. For example, the dual of {{1,2},{2,2}} is {{1},{1,2,2}}.

A multiset partition is intersecting iff no two parts are disjoint. The dual of a multiset partition is intersecting iff every pair of distinct vertices appear together in some part.

			The a(3) = 14 set systems:
   {{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,2},{1,3},{2,3}}
   {{1,2},{1,3},{1,2,3}}
   {{1,2},{2,3},{1,2,3}}
   {{1,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}}
   {{1,2},{1,3},{2,3},{1,2,3}}

Cf. A007716, A281116, A283877, A305854, A306006,  A316980, A316983, A317757, A319616.
Cf. A319752, A319765, A319766, A319767, A319768, A319769.
Intersecting set-systems are A051185.
The unlabeled multiset partition version is A319773.
The covering case is A327037.
The version without strict dual is A327038.
Cointersecting set-systems are A327039.
The BII-numbers of these set-systems are A327061.
Cf. A003465, A305843, A305844, A326854, A327020, A327040, A327052.

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}]],Union@@#==Range[n]&&UnsameQ@@dual[#]&&stableQ[#,Intersection[#1,#2]=={}&]&&stableQ[dual[#],Intersection[#1,#2]=={}&]&]],{n,0,3}] (* Gus Wiseman, Aug 19 2019 *)

a(6)-a(7) from Christian Sievers, Aug 18 2024

A327020 Number of antichains covering n vertices where every two vertices appear together in some edge (cointersecting).

Original entry on oeis.org

1, 1, 1, 2, 17, 1451, 3741198

Offset: 0

Gus Wiseman, Aug 17 2019

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges, 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}}. An antichain is a set of sets, none of which is a subset of any other. This sequence counts antichains with union {1..n} whose dual is pairwise intersecting.

			The a(0) = 1 through a(4) = 17 antichains:
  {}  {{1}}  {{12}}  {{123}}         {{1234}}
                     {{12}{13}{23}}  {{12}{134}{234}}
                                     {{13}{124}{234}}
                                     {{14}{123}{234}}
                                     {{23}{124}{134}}
                                     {{24}{123}{134}}
                                     {{34}{123}{124}}
                                     {{123}{124}{134}}
                                     {{123}{124}{234}}
                                     {{123}{134}{234}}
                                     {{124}{134}{234}}
                                     {{12}{13}{14}{234}}
                                     {{12}{23}{24}{134}}
                                     {{13}{23}{34}{124}}
                                     {{14}{24}{34}{123}}
                                     {{123}{124}{134}{234}}
                                     {{12}{13}{14}{23}{24}{34}}

Covering, intersecting antichains are A305844.
Covering, T1 antichains are A319639.
Cointersecting set-systems are A327039.
Covering, cointersecting set-systems are A327040.
Covering, cointersecting set-systems are A327051.
The non-covering version is A327057.
Covering, intersecting, T1 set-systems are A327058.
Unlabeled cointersecting antichains of multisets are A327060.
Cf. A003465, A305843, A319765, A326853, A327037, A327038, A327053.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Table[Length[Select[stableSets[Subsets[Range[n],{1,n}],SubsetQ],Union@@#==Range[n]&&stableQ[dual[#],Intersection[#1,#2]=={}&]&]],{n,0,4}]

Inverse binomial transform of A327057.

A327057 Number of antichains covering a subset of {1..n} where every two covered vertices appear together in some edge (cointersecting).

Original entry on oeis.org

1, 2, 4, 9, 36, 1572, 3750221

Offset: 0

Gus Wiseman, Aug 18 2019

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. 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}}. An antichain is a set of sets, none of which is a subset of any other. This sequence counts antichains whose dual is pairwise intersecting.

			The a(0) = 1 through a(3) = 9 antichains:
  {}  {}     {}       {}
      {{1}}  {{1}}    {{1}}
             {{2}}    {{2}}
             {{1,2}}  {{3}}
                      {{1,2}}
                      {{1,3}}
                      {{2,3}}
                      {{1,2,3}}
                      {{1,2},{1,3},{2,3}}

Antichains are A000372.
The BII-numbers of these set-systems are the intersection of A326704 and A326853.
The covering case is A327020.
Cointersecting set-systems are A327039.
Cf. A006126, A051185, A245567, A305844, A326950, A327038, A327052.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Table[Length[Select[stableSets[Subsets[Range[n],{1,n}],SubsetQ],stableQ[dual[#],Intersection[#1,#2]=={}&]&]],{n,0,5}]

Binomial transform of A327020.

A327037 Number of pairwise intersecting set-systems covering n vertices where every two vertices appear together in some edge (cointersecting).

Original entry on oeis.org

1, 1, 3, 21, 913, 1183295, 909142733955, 291200434282476769116160

Offset: 0

Gus Wiseman, Aug 17 2019

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. 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}}. This sequence counts pairwise intersecting, covering set-systems that are cointersecting, meaning their dual is pairwise intersecting.

			The a(0) = 1 through a(3) = 21 set-systems:
  {}  {{1}}  {{1,2}}      {{1,2,3}}
             {{1},{1,2}}  {{1},{1,2,3}}
             {{2},{1,2}}  {{2},{1,2,3}}
                          {{3},{1,2,3}}
                          {{1,2},{1,2,3}}
                          {{1,3},{1,2,3}}
                          {{2,3},{1,2,3}}
                          {{1},{1,2},{1,2,3}}
                          {{1},{1,3},{1,2,3}}
                          {{1,2},{1,3},{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,2},{1,3},{1,2,3}}
                          {{1,2},{2,3},{1,2,3}}
                          {{1,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}}
                          {{1,2},{1,3},{2,3},{1,2,3}}

Intersecting covering set-systems are A305843.
The unlabeled multiset partition version is A319765.
The case where the dual is strict is A319774.
The BII-numbers of these set-systems are A326912.
The non-covering version is A327038.
Cointersectng covering set-systems are A327040.
Cf. A003465, A319767, A326853, A326854, A326910.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Table[Length[Select[stableSets[Subsets[Range[n],{1,n}],Intersection[#1,#2]=={}&],Union@@#==Range[n]&&stableQ[dual[#],Intersection[#1,#2]=={}&]&]],{n,0,4}]

Inverse binomial transform of A327038.

a(6)-a(7) from Christian Sievers, Aug 18 2024

A327052 Number of T_0 (costrict) set-systems covering a subset of {1..n} where every two covered vertices appear together in some edge (cointersecting).

Original entry on oeis.org

1, 2, 6, 75, 24981, 2077072342, 9221293211115589902, 170141182628636920748880864929055912851

Offset: 0

Gus Wiseman, Aug 18 2019

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. 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}}. This sequence counts set-systems whose dual is strict and pairwise intersecting.

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

The unlabeled multiset partition version is A319760.
The non-T_0 version is A327039.
The covering case is A327053.
Cf. A051185, A319752, A319774, A327038, A327040.

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}]],UnsameQ@@dual[#]&&stableQ[dual[#],Intersection[#1,#2]=={}&]&]],{n,0,3}]

Binomial transform of A327053.

a(5)-a(7) from Christian Sievers, Feb 04 2024

A326854 BII-numbers of T_0 (costrict), pairwise intersecting set-systems where every two vertices appear together in some edge (cointersecting).

Original entry on oeis.org

0, 1, 2, 5, 6, 8, 17, 24, 34, 40, 52, 69, 70, 81, 84, 85, 88, 98, 100, 102, 104, 112, 116, 120, 128, 257, 384, 514, 640, 772, 1029, 1030, 1281, 1284, 1285, 1408, 1538, 1540, 1542, 1664, 1792, 1796, 1920, 2056, 2176, 2320, 2592, 2880, 3120, 3152, 3168, 3184

Offset: 1

Gus Wiseman, Aug 18 2019

nonn

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. 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}}. This sequence gives all BII-numbers (defined below) of pairwise intersecting set-systems whose dual is strict and pairwise intersecting.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18.

			The sequence of all set-systems that are pairwise intersecting, cointersecting, and costrict, together with their BII-numbers, begins:
    0: {}
    1: {{1}}
    2: {{2}}
    5: {{1},{1,2}}
    6: {{2},{1,2}}
    8: {{3}}
   17: {{1},{1,3}}
   24: {{3},{1,3}}
   34: {{2},{2,3}}
   40: {{3},{2,3}}
   52: {{1,2},{1,3},{2,3}}
   69: {{1},{1,2},{1,2,3}}
   70: {{2},{1,2},{1,2,3}}
   81: {{1},{1,3},{1,2,3}}
   84: {{1,2},{1,3},{1,2,3}}
   85: {{1},{1,2},{1,3},{1,2,3}}
   88: {{3},{1,3},{1,2,3}}
   98: {{2},{2,3},{1,2,3}}
  100: {{1,2},{2,3},{1,2,3}}
  102: {{2},{1,2},{2,3},{1,2,3}}

Equals the intersection of A326947, A326910, and A326853.
These set-systems are counted by A319774 (covering).
The non-T_0 version is A327061.
Cf. A029931, A048793, A051185, A305843, A319765, A326031, A327037, A327038, A327041, A327052, A327053.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Select[Range[0,10000],UnsameQ@@dual[bpe/@bpe[#]]&&stableQ[bpe/@bpe[#],Intersection[#1,#2]=={}&]&&stableQ[dual[bpe/@bpe[#]],Intersection[#1,#2]=={}&]&]

A327061 BII-numbers of pairwise intersecting set-systems where every two covered vertices appear together in some edge (cointersecting).

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 8, 16, 17, 24, 32, 34, 40, 52, 64, 65, 66, 68, 69, 70, 72, 80, 81, 84, 85, 88, 96, 98, 100, 102, 104, 112, 116, 120, 128, 256, 257, 384, 512, 514, 640, 772, 1024, 1025, 1026, 1028, 1029, 1030, 1152, 1280, 1281, 1284, 1285, 1408, 1536, 1538

Offset: 1

Gus Wiseman, Aug 18 2019

nonn

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. 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}}. This sequence gives all BII-numbers (defined below) of pairwise intersecting set-systems whose dual is also pairwise intersecting.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18.

			The sequence of all pairwise intersecting, cointersecting set-systems together with their BII-numbers begins:
   0: {}
   1: {{1}}
   2: {{2}}
   4: {{1,2}}
   5: {{1},{1,2}}
   6: {{2},{1,2}}
   8: {{3}}
  16: {{1,3}}
  17: {{1},{1,3}}
  24: {{3},{1,3}}
  32: {{2,3}}
  34: {{2},{2,3}}
  40: {{3},{2,3}}
  52: {{1,2},{1,3},{2,3}}
  64: {{1,2,3}}
  65: {{1},{1,2,3}}
  66: {{2},{1,2,3}}
  68: {{1,2},{1,2,3}}
  69: {{1},{1,2},{1,2,3}}
  70: {{2},{1,2},{1,2,3}}

The unlabeled multiset partition version is A319765.
Equals the intersection of A326853 and A326910.
The T_0 version is A326854.
These set-systems are counted by A327037 (covering) and A327038 (not covering).
Cf. A029931, A048793, A051185, A305843, A319774, A326031, A327039, A327040, A327041, A327057.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Select[Range[0,100],stableQ[bpe/@bpe[#],Intersection[#1,#2]=={}&]&&stableQ[dual[bpe/@bpe[#]],Intersection[#1,#2]=={}&]&]

cp's OEIS Frontend

A327039 Number of set-systems covering a subset of {1..n} where every two covered vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A319774 Number of intersecting set systems spanning n vertices whose dual is also an intersecting set system.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A327020 Number of antichains covering n vertices where every two vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A327057 Number of antichains covering a subset of {1..n} where every two covered vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A327037 Number of pairwise intersecting set-systems covering n vertices where every two vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A327052 Number of T_0 (costrict) set-systems covering a subset of {1..n} where every two covered vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A326854 BII-numbers of T_0 (costrict), pairwise intersecting set-systems where every two vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327061 BII-numbers of pairwise intersecting set-systems where every two covered vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs