cp's OEIS Frontend

A368097 Number of non-isomorphic multiset partitions of weight n contradicting a strict version of the axiom of choice.

%I A368097 #10 Dec 28 2023 11:32:05
%S A368097 0,0,1,3,12,37,133,433,1516,5209,18555
%N A368097 Number of non-isomorphic multiset partitions of weight n contradicting a strict version of the axiom of choice.
%C A368097 A multiset partition is a finite multiset of finite nonempty multisets. The weight of a multiset partition is the sum of cardinalities of its elements. Weight is generally not the same as number of vertices.
%C A368097 The axiom of choice says that, given any set of nonempty sets Y, it is possible to choose a set containing an element from each. The strict version requires this set to have the same cardinality as Y, meaning no element is chosen more than once.
%H A368097 Wikipedia, <a href="https://en.wikipedia.org/wiki/Axiom_of_choice">Axiom of choice</a>.
%e A368097 Non-isomorphic representatives of the a(2) = 1 through a(4) = 12 multiset partitions:
%e A368097   {{1},{1}}  {{1},{1,1}}    {{1},{1,1,1}}
%e A368097              {{1},{1},{1}}  {{1,1},{1,1}}
%e A368097              {{1},{2},{2}}  {{1},{1},{1,1}}
%e A368097                             {{1},{1},{2,2}}
%e A368097                             {{1},{1},{2,3}}
%e A368097                             {{1},{2},{1,2}}
%e A368097                             {{1},{2},{2,2}}
%e A368097                             {{2},{2},{1,2}}
%e A368097                             {{1},{1},{1},{1}}
%e A368097                             {{1},{1},{2},{2}}
%e A368097                             {{1},{2},{2},{2}}
%e A368097                             {{1},{2},{3},{3}}
%t A368097 sps[{}]:={{}};sps[set:{i_,___}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]] /@ Cases[Subsets[set],{i,___}];
%t A368097 mpm[n_]:=Join@@Table[Union[Sort[Sort/@(#/.x_Integer:>s[[x]])]& /@ sps[Range[n]]], {s,Flatten[MapIndexed[Table[#2,{#1}]&,#]]& /@ IntegerPartitions[n]}];
%t A368097 brute[m_]:=First[Sort[Table[Sort[Sort /@ (m/.Rule@@@Table[{i,p[[i]]},{i,Length[p]}])], {p,Permutations[Union@@m]}]]];
%t A368097 Table[Length[Union[brute/@Select[mpm[n], Select[Tuples[#],UnsameQ@@#&]=={}&]]], {n,0,6}]
%Y A368097 The case of unlabeled graphs appears to be A140637, complement A134964.
%Y A368097 These multiset partitions have ranks A355529.
%Y A368097 The case of labeled graphs is A367867, complement A133686.
%Y A368097 Set-systems not of this type are A367902, ranks A367906.
%Y A368097 Set-systems of this type are A367903, ranks A367907.
%Y A368097 For set-systems we have A368094, complement A368095.
%Y A368097 The complement is A368098, ranks A368100, connected case A368412.
%Y A368097 Minimal multiset partitions of this type are ranked by A368187.
%Y A368097 The connected case is A368411.
%Y A368097 Factorizations of this type are counted by A368413, complement A368414.
%Y A368097 For set multipartitions we have A368421, complement A368422.
%Y A368097 A000110 counts set partitions, non-isomorphic A000041.
%Y A368097 A003465 counts covering set-systems, unlabeled A055621.
%Y A368097 A007716 counts non-isomorphic multiset partitions, connected A007718.
%Y A368097 A058891 counts set-systems, unlabeled A000612, connected A323818.
%Y A368097 A283877 counts non-isomorphic set-systems, connected A300913.
%Y A368097 Cf. A302545, A316983, A317533, A319616, A321405, A367905, A368409, A368410.
%K A368097 nonn,more
%O A368097 0,4
%A A368097 _Gus Wiseman_, Dec 25 2023