10. Basic polyhedron 6^*

The first basic polyhedron is octahedron 6^*, with the graph symmetry group G = [3,4] of order 48, generated by 4-rotation S = (1)(2,3,5,6)(4), 2-rotation T = (1,3)(2,5)(4,6) and inversion Z = (1,4)((2,5)(3,6). It is the graph of Borromean rings, the first nontrivial Brunnian 3-component link, with the link symmetry group G' = [3⁺,4] [4]. After introducing orientation, the obtained antisymmetry group contains a rotational antireflection, from which results the amphicheirality of Borromean rings.  

From 6^* we derive source links substituting its vertices by digons. First we make all different symmetry choices of n-6 vertices (7 £ n £ 12), i.e. all different vertex bicolorings of octahedron. Their number we could find using Polya Enumeration Theorem (PET) [44]. For G = [3,4], Z_G = 1/48(t₁⁶+3t₁⁴t₂+9t₁²t₂²+6t₁²t₄+7t₂³+6t₂t₄+8t₃²+8t₆), and by the coefficients of Z_G(x,1) = 1+x+2x²+2x³+2x⁴+x⁵+x⁶ is given, respectively, the number of different choices of n-6 vertices for 6 £ n £ 12. For 7 £ n £ 12, that vertex bicolorings are: {1}; {1,2}, {1,4}; {1,2,3}, {1,2,4}; {1,2,4,5}, {1,2,3,4}; {1,2,3,4,5}; {1,2,3,4,5,6}, and to them correspond, respectively, source links of the form .a; .a.b, .a:b; .a.b.c, a:b:c; .a.b.c.d, a.b.c.d; a.b.c.d.e; a.b.c.d.e.f, given in Conway notation. After that, in every chosen vertex we make one of two possible substitutions (2 or 20), having in mind the symmetry of vertex bicolored octahedron. In the terms of colorings, this is a next bicoloring: the bicoloring of chosen vertices. For n £ 12, the source links obtained from 6^* by the vertex substitutions, are given in Table 7. Among them, for n = 11, there is 3-component link 2.20.2.20.2, omitted in [15].

Table 7  
 
 

The PR ^*-subworld of  P-world consists of links obtained replacing digons in the source links by R ^*-tangles. From the symmetry of the source links, we conclude that all further derivation represent the series of corresponding partitions with the given permutation group P. Two permutation groups are equivalent iff their permutation representations are isomorphic. Equivalent permutation groups produce the same number of  P-partitions, mutually corresponding according to the mentioned isomorphism. Hence, we will classify source links from Table 7 with respect to P-equivalence, and then derive generating links from one representative of each class. For 7 £ n £ 11, we have the following classes: .2 with P @ {(1)}; .2.2, .2.20, .2:2, .2:20 with P @ {(1,2)}; .2.2.2, .2.20.2, 2:2:20, 2:20:20 with P @ {(1,3)(2)}; .2.2.20 with P @ {(1)(2)(3)}; 2:2:2, 20:20:20 with P @ {(1,2,3)}; .2.2.2.2 with P = {(1,2,4,5)}; .2.2.2.20, 2.2.2.20 with P @ {(1)(2)(4)(5)}; .2.2.20.20, .2.20.2.20 with P @ {(1,2)(4,5), (1,4)(2,5)}; 2.2.2.2, 20.2.2.20 with P @ {(1,4)(2,3)}; 2.2.20.2, 2.2.20.20, 2.20.2.20, 20.2.20.20 with P @ {(1)(2,3)(4)}; 2.2.2.2.2, 2.2.2.20.20, 2.20.2.2.20 with P @ {(1,2)(3)(4,5)}; 2.2.2.2.20, 2.2.2.20.2 with P @ {(1)(2)(3)(4)(5)}; 20.2.2.2.20, 2.20.2.20.2 with P @ {(1,2)(3)(4,5), (1,5)(2,4)(3)}. Taking as the representative of each class its first link, we obtain the list of generating PR ^*-links (Table 8) derived from that representatives for 7 £ n £ 12. The complete list of generating PR ^*-links derived from 6^* for 7 £ n £ 12 we could directly obtain from Table 8, using the mentioned isomorphism, and including in the list the source links for n = 12 (Table 7). After that, by replacing every ^~k ^* by k ^* we could obtain all such links. The sign à has the same meaning as *, but it is used to denote mutually equivalent (commuting, interchangeable) partitions. For example, .^~4^à.^~4^à denotes .22.22 and .22.211 (=.211.22), .3^à.3^à denotes .3.3, .3.21(=.21.3) and .21.21, 3^à:3^à:3^à denotes 3:3:3, 3:21:21(=21:3:21=21:21:3) and 21:21:21, etc.

Table 8