cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A327082 BII-numbers of set-systems with cut-connectivity 2.

This page as a plain text file.
%I A327082 #15 Sep 01 2019 22:02:54
%S A327082 4,5,6,7,16,17,24,25,32,34,40,42,256,257,384,385,512,514,640,642,816,
%T A327082 817,818,819,820,821,822,823,824,825,826,827,828,829,830,831,832,833,
%U A327082 834,835,836,837,838,839,840,841,842,843,844,845,846,847,848,849,850
%N A327082 BII-numbers of set-systems with cut-connectivity 2.
%C A327082 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 (finite set of finite nonempty sets) 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. Elements of a set-system are sometimes called edges.
%C A327082 We define the cut-connectivity (A326786, A327237), of a set-system to be the minimum number of vertices that must be removed (along with any resulting empty edges) to obtain a disconnected or empty set-system, with the exception that a set-system with one vertex and no edges has cut-connectivity 1. Except for cointersecting set-systems (A326853, A327039), this is the same as vertex-connectivity (A327334, A327051).
%e A327082 The sequence of all set-systems with cut-connectivity 2 together with their BII-numbers begins:
%e A327082     4: {{1,2}}
%e A327082     5: {{1},{1,2}}
%e A327082     6: {{2},{1,2}}
%e A327082     7: {{1},{2},{1,2}}
%e A327082    16: {{1,3}}
%e A327082    17: {{1},{1,3}}
%e A327082    24: {{3},{1,3}}
%e A327082    25: {{1},{3},{1,3}}
%e A327082    32: {{2,3}}
%e A327082    34: {{2},{2,3}}
%e A327082    40: {{3},{2,3}}
%e A327082    42: {{2},{3},{2,3}}
%e A327082   256: {{1,4}}
%e A327082   257: {{1},{1,4}}
%e A327082   384: {{4},{1,4}}
%e A327082   385: {{1},{4},{1,4}}
%e A327082   512: {{2,4}}
%e A327082   514: {{2},{2,4}}
%e A327082   640: {{4},{2,4}}
%e A327082   642: {{2},{4},{2,4}}
%e A327082 The first term involving an edge of size 3 is 832: {{1,2,3},{1,4},{2,4}}.
%t A327082 bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
%t A327082 csm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[OrderedQ[#],UnsameQ@@#,Length[Intersection@@s[[#]]]>0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
%t A327082 vertConnSys[sys_]:=If[Length[csm[sys]]!=1,0,Min@@Length/@Select[Subsets[Union@@sys],Function[del,Length[csm[DeleteCases[DeleteCases[sys,Alternatives@@del,{2}],{}]]]!=1]]];
%t A327082 Select[Range[0,100],vertConnSys[bpe/@bpe[#]]==2&]
%Y A327082 Positions of 2's in A326786.
%Y A327082 BII-numbers for non-spanning edge-connectivity 2 are A327097.
%Y A327082 BII-numbers for spanning edge-connectivity 2 are A327108.
%Y A327082 The cut-connectivity 1 version is A327098.
%Y A327082 The cut-connectivity > 1 version is A327101.
%Y A327082 Covering 2-cut-connected set-systems are counted by A327112.
%Y A327082 Covering set-systems with cut-connectivity 2 are counted by A327113.
%Y A327082 Cf. A000120, A002218, A013922, A048793, A259862, A322387, A322388, A326031, A327041, A327114.
%K A327082 nonn
%O A327082 1,1
%A A327082 _Gus Wiseman_, Aug 20 2019