cp's OEIS Frontend

A327058 Number of pairwise intersecting set-systems covering n vertices whose dual is a weak antichain.

%I A327058 #4 Aug 18 2019 11:27:01
%S A327058 1,1,1,3,155
%N A327058 Number of pairwise intersecting set-systems covering n vertices whose dual is a weak antichain.
%C A327058 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}}. A weak antichain is a multiset of sets, none of which is a proper subset of any other.
%F A327058 Inverse binomial transform of A327059.
%e A327058 The a(0) = 1 through a(3) = 3 set-systems:
%e A327058   {}  {{1}}  {{12}}  {{123}}
%e A327058                      {{12}{13}{23}}
%e A327058                      {{12}{13}{23}{123}}
%t A327058 dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
%t A327058 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]]]];
%t A327058 stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
%t A327058 Table[Length[Select[stableSets[Subsets[Range[n],{1,n}],Intersection[#1,#2]=={}&],Union@@#==Range[n]&&stableQ[dual[#],SubsetQ]&]],{n,0,3}]
%Y A327058 Covering intersecting set-systems are A305843.
%Y A327058 The BII-numbers of these set-systems are the intersection of A326910 and A326966.
%Y A327058 Covering coantichains are A326970.
%Y A327058 The non-covering version is A327059.
%Y A327058 The unlabeled multiset partition version is A327060.
%Y A327058 Cf. A006126, A051185, A059523, A305844, A319639, A326961, A326965, A326968, A327020, A327057.
%K A327058 nonn,more
%O A327058 0,4
%A A327058 _Gus Wiseman_, Aug 18 2019