A309314 -id:A309314 - cp's OEIS frontend

A326752 BII-numbers of hypertrees.

0, 1, 2, 4, 8, 16, 20, 32, 36, 48, 64, 128, 256, 260, 272, 276, 292, 304, 320, 512, 516, 532, 544, 548, 560, 576, 768, 784, 800, 1024, 1040, 1056, 2048, 2064, 2068, 2080, 2084, 2096, 2112, 2304, 2308, 2336, 2560, 2564, 2576, 2816, 3072, 4096, 4100, 4128, 4608

Offset: 1

Gus Wiseman, Jul 23 2019

nonn

A binary index of n is any position of a 1 in its reversed binary expansion. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every 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. In an antichain, no edge is a subset or superset of any other edge. A hypertree is a connected antichain of nonempty sets with density -1, where density is the sum of sizes of the edges minus the number of edges minus the number of vertices.

			The sequence of all hypertrees together with their BII-numbers begins:
    0: {}
    1: {{1}}
    2: {{2}}
    4: {{1,2}}
    8: {{3}}
   16: {{1,3}}
   20: {{1,2},{1,3}}
   32: {{2,3}}
   36: {{1,2},{2,3}}
   48: {{1,3},{2,3}}
   64: {{1,2,3}}
  128: {{4}}
  256: {{1,4}}
  260: {{1,2},{1,4}}
  272: {{1,3},{1,4}}
  276: {{1,2},{1,3},{1,4}}
  292: {{1,2},{2,3},{1,4}}
  304: {{1,3},{2,3},{1,4}}
  320: {{1,2,3},{1,4}}

Cf. A000120, A000272, A030019 (spanning hypertrees), A035053, A048143, A048793, A052888, A070939, A134954, A275307, A326031, A326702, A326753.

Other BII-numbers: A309314 (hyperforests), A326701 (set partitions), A326703 (chains), A326704 (antichains), A326749 (connected), A326750 (clutters), A326751 (blobs), A326754 (covers).

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}];
density[c_]:=Total[(Length[#1]-1&)/@c]-Length[Union@@c];
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]]]]]]]]];
Select[Range[0,1000],#==0||stableQ[bpe/@bpe[#],SubsetQ]&&Length[csm[bpe/@bpe[#]]]<=1&&density[bpe/@bpe[#]]==-1&]

A326788 BII-numbers of simple labeled graphs.

Original entry on oeis.org

0, 4, 16, 20, 32, 36, 48, 52, 256, 260, 272, 276, 288, 292, 304, 308, 512, 516, 528, 532, 544, 548, 560, 564, 768, 772, 784, 788, 800, 804, 816, 820, 2048, 2052, 2064, 2068, 2080, 2084, 2096, 2100, 2304, 2308, 2320, 2324, 2336, 2340, 2352, 2356, 2560, 2564

Offset: 1

Gus Wiseman, Jul 25 2019

nonn

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 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.

Also numbers whose binary indices all belong to A018900.

			The sequence of all simple labeled graphs together with their BII-numbers begins:
    0: {}
    4: {{1,2}}
   16: {{1,3}}
   20: {{1,2},{1,3}}
   32: {{2,3}}
   36: {{1,2},{2,3}}
   48: {{1,3},{2,3}}
   52: {{1,2},{1,3},{2,3}}
  256: {{1,4}}
  260: {{1,2},{1,4}}
  272: {{1,3},{1,4}}
  276: {{1,2},{1,3},{1,4}}
  288: {{2,3},{1,4}}
  292: {{1,2},{2,3},{1,4}}
  304: {{1,3},{2,3},{1,4}}
  308: {{1,2},{1,3},{2,3},{1,4}}
  512: {{2,4}}
  516: {{1,2},{2,4}}
  528: {{1,3},{2,4}}
  532: {{1,2},{1,3},{2,4}}

Cf. A000120, A006125, A006129, A018900, A048793, A062880, A070939, A309356 (same for MM-numbers), A322551, A326031, A326702.

Other BII-numbers: A309314 (hyperforests), A326701 (set partitions), A326703 (chains), A326704 (antichains), A326749 (connected), A326750 (clutters), A326751 (blobs), A326752 (hypertrees), A326754 (covers).

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],SameQ[2,##]&@@Length/@bpe/@bpe[#]&]

A367909 Numbers n such that there is more than one way to choose a different binary index of each binary index of n.

Original entry on oeis.org

4, 12, 16, 18, 20, 32, 33, 36, 48, 52, 64, 65, 66, 68, 72, 76, 80, 82, 84, 96, 97, 100, 112, 132, 140, 144, 146, 148, 160, 161, 164, 176, 180, 192, 193, 194, 196, 200, 204, 208, 210, 212, 224, 225, 228, 240, 256, 258, 260, 264, 266, 268, 272, 274, 276, 288

Offset: 1

Gus Wiseman, Dec 11 2023

nonn

Also BII-numbers of set-systems (sets of nonempty sets) satisfying a strict version of the axiom of choice in more than one way.
A binary index of n (row n of A048793) is any position of a 1 in its reversed binary expansion. A set-system is a finite set of finite nonempty sets. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every finite set of finite nonempty sets has a different BII-number. For example, 18 has reversed binary digits (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 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.

			The set-system {{1},{1,2},{1,3}} with BII-number 21 satisfies the axiom in only one way (1,2,3), so 21 is not in the sequence.
The terms together with the corresponding set-systems begin:
   4: {{1,2}}
  12: {{1,2},{3}}
  16: {{1,3}}
  18: {{2},{1,3}}
  20: {{1,2},{1,3}}
  32: {{2,3}}
  33: {{1},{2,3}}
  36: {{1,2},{2,3}}
  48: {{1,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}}
  72: {{3},{1,2,3}}

Wikipedia, Axiom of choice.

These set-systems are counted by A367772.
Positions of terms > 1 in A367905, firsts A367910, sorted firsts A367911.
If there is at least one choice we get A367906, counted by A367902.
If there are no choices we get A367907, counted by A367903.
If there is one unique choice we get A367908, counted by A367904.
A048793 lists binary indices, length A000120, reverse A272020, sum A029931.
A058891 counts set-systems, covering A003465, connected A323818.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
A326031 gives weight of the set-system with BII-number n.
A368098 counts unlabeled multiset partitions per axiom, complement A368097.
Cf. A000612, A055621, A072639, A309326, A326702, A326753, A355529, A368100.
BII-numbers: A309314 (hyperforests), A326701 (set partitions), A326703 (chains), A326704 (antichains), A326749 (connected), A326750 (clutters), A326751 (blobs), A326752 (hypertrees), A326754 (covers), A326783 (uniform), A326784 (regular), A326788 (simple), A330217 (achiral).

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[100], Length[Select[Tuples[bpe/@bpe[#]], UnsameQ@@#&]]>1&]

A367907 U A367908 U A367909 = A000027.

cp's OEIS Frontend

A326752 BII-numbers of hypertrees.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A326788 BII-numbers of simple labeled graphs.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A367909 Numbers n such that there is more than one way to choose a different binary index of each binary index of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula