Conway polyhedron notation

<h2 id="operators">Operators</h2>
In Conway's notation, operations on polyhedra are applied like functions, from right to left. For example, a <a href="/facts/Cuboctahedron/hD7p0Mem">cuboctahedron</a> is an ambo cube,<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> i.e. ⁠
 
 
 
 a
 (
 C
 )
 =
 a
 C
 
 
 {\displaystyle a(C)=aC}
 
⁠, and a <a href="/facts/Truncated_cuboctahedron/nd2ltxcm">truncated cuboctahedron</a> is ⁠
 
 
 
 t
 (
 a
 (
 C
 )
 )
 =
 t
 (
 a
 C
 )
 =
 t
 a
 C
 
 
 {\displaystyle t(a(C))=t(aC)=taC}
 
⁠. Repeated application of an operator can be denoted with an exponent: j2 = o. In general, Conway operators are not <a href="/facts/Commutative/WaYxJLxd">commutative</a>.
Individual operators can be visualized in terms of <a href="/facts/Fundamental_domain/e68KDYWu">fundamental domains</a> (or chambers), as below. Each right triangle is a <a href="/facts/Fundamental_domain/e68KDYWu">fundamental domain</a>. Each white chamber is a rotated version of the others, and so is each colored chamber. For <a href="/facts/Achiral/hjx0eGrB">achiral</a> operators, the colored chambers are a reflection of the white chambers, and all are transitive. In group terms, achiral operators correspond to <a href="/facts/Dihedral_group/1PUlRh4M">dihedral groups</a> Dn where n is the number of sides of a face, while chiral operators correspond to <a href="/facts/Cyclic_group/JL5zfFuL">cyclic groups</a> Cn lacking the reflective symmetry of the dihedral groups. Achiral and <a href="/facts/Chiral/hjx0eGrB">chiral</a> operators are also called local symmetry-preserving operations (LSP) and local operations that preserve orientation-preserving symmetries (LOPSP), respectively.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a><a class="footnote-ref" id="fnref:8" href="#fn:8">8</a><a class="footnote-ref" id="fnref:9" href="#fn:9">9</a>
LSPs should be understood as local operations that preserve symmetry, not operations that preserve local symmetry. Again, these are symmetries in a topological sense, not a geometric sense: the exact angles and edge lengths may differ.

Fundamental domains of faces with n {\displaystyle n} sides<table><tbody><tr><th>3 (Triangle)</th><th>4 (Square)</th><th>5 (Pentagon)</th><th>6 (Hexagon)</th></tr><tr><td></td><td></td><td></td><td></td></tr><tr><td colspan="4">The fundamental domains for polyhedron groups. The groups are D 3 , D 4 , D 5 , D 6 {\displaystyle D_{3},D_{4},D_{5},D_{6}}  for achiral polyhedra, and C 3 , C 4 , C 5 , C 6 {\displaystyle C_{3},C_{4},C_{5},C_{6}}  for chiral polyhedra.</td></tr></tbody></table>
Hart introduced the reflection operator r, that gives the mirror image of the polyhedron.<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> This is not strictly a LOPSP, since it does not preserve orientation: it reverses it, by exchanging white and red chambers. r has no effect on achiral polyhedra aside from orientation, and rr = S returns the original polyhedron. An overline can be used to indicate the other chiral form of an operator: s = rsr.
An operation is irreducible if it cannot be expressed as a composition of operators aside from d and r. The majority of Conway's original operators are irreducible: the exceptions are e, b, o, and m.

<h3>Matrix representation</h3>
<table><tbody><tr><th>x</th><td> [ a b c 0 d 0 a ′ b ′ c ′ ] = M x {\displaystyle {\begin{bmatrix}a&b&c\\0&d&0\\a'&b'&c'\end{bmatrix}}=\mathbf {M} _{x}} </td></tr><tr><th>xd</th><td> [ c b a 0 d 0 c ′ b ′ a ′ ] = M x M d {\displaystyle {\begin{bmatrix}c&b&a\\0&d&0\\c'&b'&a'\end{bmatrix}}=\mathbf {M} _{x}\mathbf {M} _{d}} </td></tr><tr><th>dx</th><td> [ a ′ b ′ c ′ 0 d 0 a b c ] = M d M x {\displaystyle {\begin{bmatrix}a'&b'&c'\\0&d&0\\a&b&c\end{bmatrix}}=\mathbf {M} _{d}\mathbf {M} _{x}} </td></tr><tr><th>dxd</th><td> [ c ′ b ′ a ′ 0 d 0 c b a ] = M d M x M d {\displaystyle {\begin{bmatrix}c'&b'&a'\\0&d&0\\c&b&a\end{bmatrix}}=\mathbf {M} _{d}\mathbf {M} _{x}\mathbf {M} _{d}} </td></tr></tbody></table>
The relationship between the number of vertices, edges, and faces of the seed and the polyhedron created by the operations listed in this article can be expressed as a matrix 
 
 
 
 
 
 M
 
 
 x
 
 
 
 
 {\displaystyle \mathbf {M} _{x}}
 
. When x is the operator, 
 
 
 
 v
 ,
 e
 ,
 f
 
 
 {\displaystyle v,e,f}
 
 are the vertices, edges, and faces of the seed (respectively), and 
 
 
 
 
 v
 ′
 
 ,
 
 e
 ′
 
 ,
 
 f
 ′
 
 
 
 {\displaystyle v',e',f'}
 
 are the vertices, edges, and faces of the result, then

M
 
 
 x
 
 
 
 
 [
 
 
 
 v
 
 
 
 
 e
 
 
 
 
 f
 
 
 
 ]
 
 
 =
 
 
 [
 
 
 
 
 v
 ′
 
 
 
 
 
 
 e
 ′
 
 
 
 
 
 
 f
 ′
 
 
 
 
 ]
 
 
 
 
 {\displaystyle \mathbf {M} _{x}{\begin{bmatrix}v\\e\\f\end{bmatrix}}={\begin{bmatrix}v'\\e'\\f'\end{bmatrix}}}
 
.
The matrix for the composition of two operators is just the product of the matrixes for the two operators. Distinct operators may have the same matrix, for example, p and l. The edge count of the result is an integer multiple d of that of the seed: this is called the inflation rate, or the edge factor.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a>
The simplest operators, the <a href="/facts/Identity_operator/9AtsP0LC">identity operator</a> S and the <a href="/facts/Dual_polyhedron/rkIHbmAf">dual operator</a> d, have simple matrix forms:

M
          
          
            S
          
        
        =
        
          
            [
            
              
                
                  1
                
                
                  0
                
                
                  0
                
              
              
                
                  0
                
                
                  1
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  1
                
              
            
            ]
          
        
        =
        
          
            I
          
          
            3
          
        
      
    
    {\displaystyle \mathbf {M} _{S}={\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}}=\mathbf {I} _{3}}
  
, 
  
    
      
        
          
            M
          
          
            d
          
        
        =
        
          
            [
            
              
                
                  0
                
                
                  0
                
                
                  1
                
              
              
                
                  0
                
                
                  1
                
                
                  0
                
              
              
                
                  1
                
                
                  0
                
                
                  0
                
              
            
            ]
          
        
      
    
    {\displaystyle \mathbf {M} _{d}={\begin{bmatrix}0&0&1\\0&1&0\\1&0&0\end{bmatrix}}}

Two dual operators cancel out; dd = S, and the square of 
 
 
 
 
 
 M
 
 
 d
 
 
 
 
 {\displaystyle \mathbf {M} _{d}}
 
 is the <a href="/facts/Identity_matrix/Glbcf6ol">identity matrix</a>. When applied to other operators, the dual operator corresponds to horizontal and vertical reflections of the matrix. Operators can be grouped into groups of four (or fewer if some forms are the same) by identifying the operators x, xd (operator of dual), dx (dual of operator), and dxd (conjugate of operator). In this article, only the matrix for x is given, since the others are simple reflections.

<h3>Number of operators</h3>
The number of LSPs for each inflation rate is 
 
 
 
 2
 ,
 2
 ,
 4
 ,
 6
 ,
 6
 ,
 20
 ,
 28
 ,
 58
 ,
 82
 ,
 ⋯
 
 
 {\displaystyle 2,2,4,6,6,20,28,58,82,\cdots }
 
 starting with inflation rate 1. However, not all LSPs necessarily produce a polyhedron whose edges and vertices form a <a href="/facts/K-vertex-connected_graph/EST9uf8W">3-connected graph</a>, and as a consequence of <a href="/facts/Steinitz%2527s_theorem/FEq947FE">Steinitz's theorem</a> do not necessarily produce a convex polyhedron from a convex seed. The number of 3-connected LSPs for each inflation rate is 
 
 
 
 2
 ,
 2
 ,
 4
 ,
 6
 ,
 4
 ,
 20
 ,
 20
 ,
 54
 ,
 64
 ,
 ⋯
 
 
 {\displaystyle 2,2,4,6,4,20,20,54,64,\cdots }
 
.<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a>

<h2 id="original-operations">Original operations</h2>
Strictly, seed (S), needle (n), and zip (z) were not included by Conway, but they are related to original Conway operations by duality so are included here.
From here on, operations are visualized on cube seeds, drawn on the surface of that cube. Blue faces cross edges of the seed, and pink faces lie over vertices of the seed. There is some flexibility in the exact placement of vertices, especially with chiral operators.

Original Conway operators<table><tbody><tr><th>Edge factor</th><th>Matrix M x {\displaystyle \mathbf {M} _{x}} </th><th>x</th><th>xd</th><th>dx</th><th>dxd</th><th>Notes</th></tr><tr><td>1</td><td> [ 1 0 0 0 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}}} </td><td>Seed: S</td><td colspan="2">Dual: d</td><td>Seed: dd = S</td><td>Dual replaces each face with a vertex, and each vertex with a face.</td></tr><tr><td>2</td><td> [ 1 0 1 0 2 0 0 1 0 ] {\displaystyle {\begin{bmatrix}1&0&1\\0&2&0\\0&1&0\end{bmatrix}}} </td><td colspan="2">Join: j</td><td colspan="2">Ambo: a</td><td>Join creates quadrilateral faces. Ambo creates degree-4 vertices, and is also called <a href="/facts/Rectification_(geometry)/PkoUdq53">rectification</a>, or the <a href="/facts/Medial_graph/50RBjLJI">medial graph</a> in graph theory.<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a></td></tr><tr><td>3</td><td> [ 1 0 1 0 3 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&0&1\\0&3&0\\0&2&0\end{bmatrix}}} </td><td>Kis: k</td><td>Needle: n</td><td>Zip: z</td><td>Truncate: t</td><td>Kis raises a pyramid on each face, and is also called akisation, <a href="/facts/Kleetope/eRlGf2qH">Kleetope</a>, cumulation,<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a> accretion, or pyramid-<a href="/facts/Augmentation_(geometry)/8SR7CyNz">augmentation</a>. <a href="/facts/Truncation_(geometry)/DYb589Je">Truncate</a> cuts off the polyhedron at its vertices but leaves a portion of the original edges.<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a> Zip is also called <a href="/facts/Bitruncation/t0xarbyJ">bitruncation</a>.</td></tr><tr><td>4</td><td> [ 1 1 1 0 4 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&1&1\\0&4&0\\0&2&0\end{bmatrix}}} </td><td colspan="2"> Ortho: o = jj</td><td colspan="2"> Expand: e = aa</td><td></td></tr><tr><td>5</td><td> [ 1 2 1 0 5 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&2&1\\0&5&0\\0&2&0\end{bmatrix}}} </td><td>Gyro: g</td><td>gd = rgr</td><td>sd = rsr</td><td>Snub: s</td><td>Chiral operators. See <a href="/facts/Snub_(geometry)/T8opxlLu">Snub (geometry)</a>. Contrary to Hart,<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a> gd is not the same as g: it is its chiral pair.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a></td></tr><tr><td>6</td><td> [ 1 1 1 0 6 0 0 4 0 ] {\displaystyle {\begin{bmatrix}1&1&1\\0&6&0\\0&4&0\end{bmatrix}}} </td><td colspan="2"> Meta: m = kj</td><td colspan="2"> Bevel: b = ta</td><td></td></tr></tbody></table>
<h2 id="seeds">Seeds</h2>
Any polyhedron can serve as a seed, as long as the operations can be executed on it. Common seeds have been assigned a letter.
The <a href="/facts/Platonic_solid/jraREXFD">Platonic solids</a> are represented by the first letter of their name (<a href="/facts/Tetrahedron/7mkSrl6j">Tetrahedron</a>, <a href="/facts/Octahedron/G38q92xW">Octahedron</a>, <a href="/facts/Cube/65lUaAqN">Cube</a>, <a href="/facts/Icosahedron/wWbpnDYp">Icosahedron</a>, <a href="/facts/Dodecahedron/7r519eCl">Dodecahedron</a>); the <a href="/facts/Prism_(geometry)/baIRRkCy">prisms</a> (Pn) for n-gonal forms; <a href="/facts/Antiprism/FgP5jIVd">antiprisms</a> (An); <a href="/facts/Cupola_(geometry)/BFcmxRQI">cupolae</a> (Un); <a href="/facts/Anticupola/BFcmxRQI">anticupolae</a> (Vn); and <a href="/facts/Pyramid_(geometry)/fCXRgFwu">pyramids</a> (Yn). Any <a href="/facts/Johnson_solid/8SR7CyNz">Johnson solid</a> can be referenced as Jn, for n=1..92.
All of the five Platonic solids can be generated from prismatic generators with zero to two operators:<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a>

<ul><li><a href="/facts/Triangular_pyramid/7mkSrl6j">Triangular pyramid</a>: Y3 (A tetrahedron is a special pyramid)
<ul><li><a href="/facts/Tetrahedron/7mkSrl6j">T</a> = Y3</li>
<li><a href="/facts/Octahedron/G38q92xW">O</a> = aT (ambo tetrahedron)</li>
<li><a href="/facts/Cube/65lUaAqN">C</a> = jT (join tetrahedron)</li>
<li><a href="/facts/Regular_icosahedron/1U93vmXV">I</a> = sT (snub tetrahedron)</li>
<li><a href="/facts/Regular_dodecahedron/xClYqhcp">D</a> = gT (gyro tetrahedron)</li></ul></li>
<li><a href="/facts/Antiprism/FgP5jIVd">Triangular antiprism</a>: A3 (An octahedron is a special antiprism)
<ul><li>O = A3</li>
<li>C = dA3</li></ul></li>
<li><a href="/facts/Prism_(geometry)/baIRRkCy">Square prism</a>: P4 (A cube is a special prism)
<ul><li>C = P4</li></ul></li>
<li><a href="/facts/Pentagonal_antiprism/gR8aMBKN">Pentagonal antiprism</a>: A5
<ul><li>I = k5A5 (A special <a href="/facts/Gyroelongated_dipyramid/g8Kln53f">gyroelongated dipyramid</a>)</li>
<li>D = t5dA5 (A special <a href="/facts/Truncated_trapezohedron/do6VGoQ6">truncated trapezohedron</a>)</li></ul></li></ul>

The regular Euclidean tilings can also be used as seeds:

<ul><li>Q = Quadrille = <a href="/facts/Square_tiling/3ym86mvv">Square tiling</a></li>
<li>H = Hextille = <a href="/facts/Hexagonal_tiling/HwG5F0YH">Hexagonal tiling</a> = dΔ</li>
<li>Δ = Deltille = <a href="/facts/Triangular_tiling/Jx8f8Krh">Triangular tiling</a> = dH</li></ul>
<h2 id="extended-operations">Extended operations</h2>
These are operations created after Conway's original set. Note that many more operations exist than have been named; just because an operation is not here does not mean it does not exist (or is not an LSP or LOPSP). In addition, only irreducible operators are
included in this list; many others can be created by composing operators together.

Irreducible extended operators<table><tbody><tr><th>Edge factor</th><th>Matrix M x {\displaystyle \mathbf {M} _{x}} </th><th>x</th><th>xd</th><th>dx</th><th>dxd</th><th>Notes</th></tr><tr><td>4</td><td> [ 1 2 0 0 4 0 0 1 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&4&0\\0&1&1\end{bmatrix}}} </td><td>Chamfer: c</td><td>cd = du</td><td> dc = ud</td><td>Subdivide: u</td><td>Chamfer is the join-form of l. See <a href="/facts/Chamfer_(geometry)/hQEGYQpl">Chamfer (geometry)</a>.</td></tr><tr><td>5</td><td> [ 1 2 0 0 5 0 0 2 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&5&0\\0&2&1\end{bmatrix}}} </td><td>Propeller: p</td><td colspan="2">dp = pd</td><td>dpd = p</td><td>Chiral operators. The propeller operator was developed by George Hart.<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a></td></tr><tr><td>5</td><td> [ 1 2 0 0 5 0 0 2 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&5&0\\0&2&1\end{bmatrix}}} </td><td>Loft: l</td><td>ld</td><td> dl</td><td>dld</td><td></td></tr><tr><td>6</td><td> [ 1 3 0 0 6 0 0 2 1 ] {\displaystyle {\begin{bmatrix}1&3&0\\0&6&0\\0&2&1\end{bmatrix}}} </td><td>Quinto: q</td><td>qd</td><td> dq</td><td>dqd</td><td></td></tr><tr><td>6</td><td> [ 1 2 0 0 6 0 0 3 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&6&0\\0&3&1\end{bmatrix}}} </td><td>Join-lace: L0</td><td>L0d</td><td>dL0</td><td>dL0d</td><td>See below for explanation of join notation.</td></tr><tr><td>7</td><td> [ 1 2 0 0 7 0 0 4 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&7&0\\0&4&1\end{bmatrix}}} </td><td>Lace: L</td><td>Ld</td><td> dL</td><td>dLd</td><td></td></tr><tr><td>7</td><td> [ 1 2 1 0 7 0 0 4 0 ] {\displaystyle {\begin{bmatrix}1&2&1\\0&7&0\\0&4&0\end{bmatrix}}} </td><td>Stake: K</td><td>Kd</td><td> dK</td><td>dKd</td><td></td></tr><tr><td>7</td><td> [ 1 4 0 0 7 0 0 2 1 ] {\displaystyle {\begin{bmatrix}1&4&0\\0&7&0\\0&2&1\end{bmatrix}}} </td><td>Whirl: w</td><td>wd = dv</td><td>vd = dw</td><td>Volute: v</td><td>Chiral operators.</td></tr><tr><td>8</td><td> [ 1 2 1 0 8 0 0 5 0 ] {\displaystyle {\begin{bmatrix}1&2&1\\0&8&0\\0&5&0\end{bmatrix}}} </td><td>Join-kis-kis: ⁠ ( k k ) 0 {\displaystyle (kk)_{0}} ⁠</td><td> ⁠ ( k k ) 0 d {\displaystyle (kk)_{0}d} ⁠</td><td> ⁠ d ( k k ) 0 {\displaystyle d(kk)_{0}} ⁠</td><td> ⁠ d ( k k ) 0 d {\displaystyle d(kk)_{0}d} ⁠</td><td>Sometimes named J.<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a> See below for explanation of join notation. The non-join-form, kk, is not irreducible.</td></tr><tr><td>10</td><td> [ 1 3 1 0 10 0 0 6 0 ] {\displaystyle {\begin{bmatrix}1&3&1\\0&10&0\\0&6&0\end{bmatrix}}} </td><td>Cross: X</td><td>Xd</td><td> dX</td><td>dXd</td><td></td></tr></tbody></table>
<h2 id="indexed-extended-operations">Indexed extended operations</h2>
A number of operators can be grouped together by some criteria, or have their behavior modified by an index.<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> These are written as an operator with a subscript: xn.

<h3>Augmentation</h3>
<a href="/facts/Augmentation_(geometry)/8SR7CyNz">Augmentation</a> operations retain original edges. They may be applied to any independent subset of faces, or may be converted into a join-form by removing the original edges. Conway notation supports an optional index to these operators: 0 for the join-form, or 3 or higher for how many sides affected faces have. For example, k4Y4=O: taking a square-based pyramid and gluing another pyramid to the square base gives an octahedron.

<table><tbody><tr><th>Augmentation operator</th><td>x</td><td>k</td><td>l</td><td>L</td><td>K</td><td>(kk)</td></tr><tr><th>Correspondingjoin-form operator</th><td>x0</td><td>k0 = j</td><td>l0 = c</td><td>L0</td><td>K0 = jk</td><td>(kk)0</td></tr><tr><th>Augmentation</th><td></td><td><a href="/facts/Pyramid_(geometry)/fCXRgFwu">Pyramid</a></td><td><a href="/facts/Prism_(geometry)/baIRRkCy">Prism</a></td><td><a href="/facts/Antiprism/FgP5jIVd">Antiprism</a></td><td></td><td></td></tr></tbody></table>
The truncate operator t also has an index form tn, indicating that only vertices of a certain degree are truncated. It is equivalent to dknd.
Some of the extended operators can be created in special cases with kn and tn operators. For example, a <a href="/facts/Chamfered_cube/hQEGYQpl">chamfered cube</a>, cC, can be constructed as t4daC, as a <a href="/facts/Rhombic_dodecahedron/X3npAlmr">rhombic dodecahedron</a>, daC or jC, with its degree-4 vertices truncated. A lofted cube, lC is the same as t4kC. A quinto-dodecahedron, qD can be constructed as t5daaD or t5deD or t5oD, a <a href="/facts/Deltoidal_hexecontahedron/IWvmY471">deltoidal hexecontahedron</a>, deD or oD, with its degree-5 vertices truncated.

<h3>Meta/Bevel</h3>
Meta adds vertices at the center and along the edges, while bevel adds faces at the center, seed vertices, and along the edges. The index is how many vertices or faces are added along the edges. Meta (in its non-indexed form) is also called <a href="/facts/Cantitruncation/hmbMrRm6">cantitruncation</a> or <a href="/facts/Omnitruncation/hmbMrRm6">omnitruncation</a>. Note that 0 here does not mean the same as for augmentation operations: it means zero vertices (or faces) are added along the edges.<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a>

Meta/Bevel operators<table><tbody><tr><th>n</th><th>Edge factor</th><th>Matrix M x {\displaystyle \mathbf {M} _{x}} </th><th>x</th><th>xd</th><th>dx</th><th>dxd</th></tr><tr><td>0</td><td>3</td><td> [ 1 0 1 0 3 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&0&1\\0&3&0\\0&2&0\end{bmatrix}}} </td><td>k = m0</td><td>n</td><td>z = b0</td><td>t</td></tr><tr><td>1</td><td>6</td><td> [ 1 1 1 0 6 0 0 4 0 ] {\displaystyle {\begin{bmatrix}1&1&1\\0&6&0\\0&4&0\end{bmatrix}}} </td><td colspan="2"> m = m1 = kj</td><td colspan="2"> b = b1 = ta</td></tr><tr><td>2</td><td>9</td><td> [ 1 2 1 0 9 0 0 6 0 ] {\displaystyle {\begin{bmatrix}1&2&1\\0&9&0\\0&6&0\end{bmatrix}}} </td><td>m2</td><td>m2d</td><td>b2</td><td>b2d</td></tr><tr><td>3</td><td>12</td><td> [ 1 3 1 0 12 0 0 8 0 ] {\displaystyle {\begin{bmatrix}1&3&1\\0&12&0\\0&8&0\end{bmatrix}}} </td><td>m3</td><td>m3d</td><td>b3</td><td>b3d</td></tr><tr><td>n</td><td>3n+3</td><td> [ 1 n 1 0 3 n + 3 0 0 2 n + 2 0 ] {\displaystyle {\begin{bmatrix}1&n&1\\0&3n+3&0\\0&2n+2&0\end{bmatrix}}} </td><td>mn</td><td>mnd</td><td>bn</td><td>bnd</td></tr></tbody></table>
<h3>Medial</h3>
Medial is like meta, except it does not add edges from the center to each seed vertex. The index 1 form is identical to Conway's ortho and expand operators: expand is also called <a href="/facts/Cantellation_(geometry)/kS24Tde3">cantellation</a> and <a href="/facts/Expansion_(geometry)/eMpoRlnm">expansion</a>. Note that o and e have their own indexed forms, described below. Also note that some implementations start indexing at 0 instead of 1.<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a>

Medial operators<table><tbody><tr><th>n</th><th>Edgefactor</th><th>Matrix M x {\displaystyle \mathbf {M} _{x}} </th><th>x</th><th>xd</th><th>dx</th><th>dxd</th></tr><tr><td>1</td><td>4</td><td> [ 1 1 1 0 4 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&1&1\\0&4&0\\0&2&0\end{bmatrix}}} </td><td colspan="2"> M1 = o = jj</td><td colspan="2"> e = aa</td></tr><tr><td>2</td><td>7</td><td> [ 1 2 1 0 7 0 0 4 0 ] {\displaystyle {\begin{bmatrix}1&2&1\\0&7&0\\0&4&0\end{bmatrix}}} </td><td>Medial: M = M2</td><td>Md</td><td>dM</td><td>dMd</td></tr><tr><td>n</td><td>3n+1</td><td> [ 1 n 1 0 3 n + 1 0 0 2 n 0 ] {\displaystyle {\begin{bmatrix}1&n&1\\0&3n+1&0\\0&2n&0\end{bmatrix}}} </td><td>Mn</td><td>Mnd</td><td>dMn</td><td>dMnd</td></tr></tbody></table>
<h3>Goldberg-Coxeter</h3>
The Goldberg-Coxeter (GC) Conway operators are two infinite families of operators that are an extension of the <a href="/facts/Goldberg-Coxeter_construction/BHTVwjI6">Goldberg-Coxeter construction</a>.<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a><a class="footnote-ref" id="fnref:25" href="#fn:25">25</a> The GC construction can be thought of as taking a triangular section of a triangular lattice, or a square section of a square lattice, and laying that over each face of the polyhedron. This construction can be extended to any face by identifying the chambers of the triangle or square (the "master polygon").<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a> Operators in the triangular family can be used to produce the <a href="/facts/Goldberg_polyhedra/Hp56kpJ1">Goldberg polyhedra</a> and <a href="/facts/Geodesic_polyhedra/AaaKjYB9">geodesic polyhedra</a>: see <a href="/facts/List_of_geodesic_polyhedra_and_Goldberg_polyhedra/w9Cv5kzF">List of geodesic polyhedra and Goldberg polyhedra</a> for formulas.
The two families are the triangular GC family, ca,b and ua,b, and the quadrilateral GC family, ea,b and oa,b. Both the GC families are indexed by two integers 
 
 
 
 a
 ≥
 1
 
 
 {\displaystyle a\geq 1}
 
 and 
 
 
 
 b
 ≥
 0
 
 
 {\displaystyle b\geq 0}
 
. They possess many nice qualities:

<ul><li>The indexes of the families have a relationship with certain <a href="/facts/Euclidean_domain/ydwCD0fz">Euclidean domains</a> over the complex numbers: the <a href="/facts/Eisenstein_integers/UGQmFI8c">Eisenstein integers</a> for the triangular GC family, and the <a href="/facts/Gaussian_integers/zj82AhtL">Gaussian integers</a> for the quadrilateral GC family.</li>
<li>Operators in the x and dxd columns within the same family commute with each other.</li></ul>
The operators are divided into three classes (examples are written in terms of c but apply to all 4 operators):

<ul><li>Class I: ⁠
 
 
 
 b
 =
 0
 
 
 {\displaystyle b=0}
 
⁠. Achiral, preserves original edges. Can be written with the zero index suppressed, e.g. ca,0 = ca.</li>
<li>Class II: ⁠
 
 
 
 a
 =
 b
 
 
 {\displaystyle a=b}
 
⁠. Also achiral. Can be decomposed as ca,a = cac1,1</li>
<li>Class III: All other operators. These are chiral, and ca,b and cb,a are the chiral pairs of each other.</li></ul>
Of the original Conway operations, the only ones that do not fall into the GC family are g and s (gyro and snub). Meta and bevel (m and b) can be expressed in terms of one operator from the triangular family and one from the quadrilateral family.

<h4>Triangular</h4>
Triangular Goldberg-Coxeter operators<table><tbody><tr><th>a</th><th>b</th><th>Class</th><th>Edge factor T = a2 + ab + b2</th><th>Matrix M x {\displaystyle \mathbf {M} _{x}} </th><th>Master triangle</th><th>x</th><th>xd</th><th>dx</th><th>dxd</th></tr><tr><td>1</td><td>0</td><td>I</td><td>1</td><td> [ 1 0 0 0 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}}} </td><td></td><td>u1 = S</td><td colspan="2">d</td><td>c1 = S</td></tr><tr><td>2</td><td>0</td><td>I</td><td>4</td><td> [ 1 1 0 0 4 0 0 2 1 ] {\displaystyle {\begin{bmatrix}1&1&0\\0&4&0\\0&2&1\end{bmatrix}}} </td><td></td><td>u2 = u</td><td>dc</td><td>du</td><td>c2 = c</td></tr><tr><td>3</td><td>0</td><td>I</td><td>9</td><td> [ 1 2 1 0 9 0 0 6 0 ] {\displaystyle {\begin{bmatrix}1&2&1\\0&9&0\\0&6&0\end{bmatrix}}} </td><td></td><td>u3 = nn</td><td>nk</td><td>zt</td><td>c3 = zz</td></tr><tr><td>4</td><td>0</td><td>I</td><td>16</td><td> [ 1 5 0 0 16 0 0 10 1 ] {\displaystyle {\begin{bmatrix}1&5&0\\0&16&0\\0&10&1\end{bmatrix}}} </td><td></td><td>u4 = uu</td><td>uud = dcc</td><td>duu = ccd</td><td>c4 = cc</td></tr><tr><td>5</td><td>0</td><td>I</td><td>25</td><td> [ 1 8 0 0 25 0 0 16 1 ] {\displaystyle {\begin{bmatrix}1&8&0\\0&25&0\\0&16&1\end{bmatrix}}} </td><td></td><td>u5</td><td>u5d = dc5</td><td>du5 = c5d</td><td>c5</td></tr><tr><td>6</td><td>0</td><td>I</td><td>36</td><td> [ 1 11 1 0 36 0 0 24 0 ] {\displaystyle {\begin{bmatrix}1&11&1\\0&36&0\\0&24&0\end{bmatrix}}} </td><td></td><td>u6 = unn</td><td>unk</td><td>czt</td><td>u6 = czz</td></tr><tr><td>7</td><td>0</td><td>I</td><td>49</td><td> [ 1 16 0 0 49 0 0 32 1 ] {\displaystyle {\begin{bmatrix}1&16&0\\0&49&0\\0&32&1\end{bmatrix}}} </td><td></td><td>u7 = u2,1u1,2 = vrv</td><td>vrvd = dwrw</td><td>dvrv = wrwd</td><td>c7 = c2,1c1,2 = wrw</td></tr><tr><td>8</td><td>0</td><td>I</td><td>64</td><td> [ 1 21 0 0 64 0 0 42 1 ] {\displaystyle {\begin{bmatrix}1&21&0\\0&64&0\\0&42&1\end{bmatrix}}} </td><td></td><td>u8 = u3</td><td>u3d = dc3</td><td>du3 = c3d</td><td>c8 = c3</td></tr><tr><td>9</td><td>0</td><td>I</td><td>81</td><td> [ 1 26 1 0 81 0 0 54 0 ] {\displaystyle {\begin{bmatrix}1&26&1\\0&81&0\\0&54&0\end{bmatrix}}} </td><td></td><td>u9 = n4</td><td>n3k = kz3</td><td>tn3 = z3t</td><td>c9 = z4</td></tr><tr><td>1</td><td>1</td><td>II</td><td>3</td><td> [ 1 0 1 0 3 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&0&1\\0&3&0\\0&2&0\end{bmatrix}}} </td><td></td><td>u1,1 = n</td><td>k</td><td>t</td><td>c1,1 = z</td></tr><tr><td>2</td><td>1</td><td>III</td><td>7</td><td> [ 1 2 0 0 7 0 0 4 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&7&0\\0&4&1\end{bmatrix}}} </td><td></td><td>v = u2,1</td><td>vd = dw</td><td>dv = wd</td><td>w = c2,1</td></tr><tr><td>3</td><td>1</td><td>III</td><td>13</td><td> [ 1 4 0 0 13 0 0 8 1 ] {\displaystyle {\begin{bmatrix}1&4&0\\0&13&0\\0&8&1\end{bmatrix}}} </td><td></td><td>u3,1</td><td>u3,1d = dc3,1</td><td>du3,1 = c3,1d</td><td>c3,1</td></tr><tr><td>3</td><td>2</td><td>III</td><td>19</td><td> [ 1 6 0 0 19 0 0 12 1 ] {\displaystyle {\begin{bmatrix}1&6&0\\0&19&0\\0&12&1\end{bmatrix}}} </td><td></td><td>u3,2</td><td>u3,2d = dc3,2</td><td>du3,2 = c3,2d</td><td>c3,2</td></tr><tr><td>4</td><td>3</td><td>III</td><td>37</td><td> [ 1 12 0 0 37 0 0 24 1 ] {\displaystyle {\begin{bmatrix}1&12&0\\0&37&0\\0&24&1\end{bmatrix}}} </td><td></td><td>u4,3</td><td>u4,3d = dc4,3</td><td>du4,3 = c4,3d</td><td>c4,3</td></tr><tr><td>5</td><td>4</td><td>III</td><td>61</td><td> [ 1 20 0 0 61 0 0 40 1 ] {\displaystyle {\begin{bmatrix}1&20&0\\0&61&0\\0&40&1\end{bmatrix}}} </td><td></td><td>u5,4</td><td>u5,4d = dc5,4</td><td>du5,4 = c5,4d</td><td>c5,4</td></tr><tr><td>6</td><td>5</td><td>III</td><td>91</td><td> [ 1 30 0 0 91 0 0 60 1 ] {\displaystyle {\begin{bmatrix}1&30&0\\0&91&0\\0&60&1\end{bmatrix}}} </td><td></td><td>u6,5 = u1,2u1,3</td><td>u6,5d = dc6,5</td><td>du6,5 = c6,5d</td><td>c6,5=c1,2c1,3</td></tr><tr><td>7</td><td>6</td><td>III</td><td>127</td><td> [ 1 42 0 0 127 0 0 84 1 ] {\displaystyle {\begin{bmatrix}1&42&0\\0&127&0\\0&84&1\end{bmatrix}}} </td><td></td><td>u7,6</td><td>u7,6d = dc7,6</td><td>du7,6 = c7,6d</td><td>c7,6</td></tr><tr><td>8</td><td>7</td><td>III</td><td>169</td><td> [ 1 56 0 0 169 0 0 112 1 ] {\displaystyle {\begin{bmatrix}1&56&0\\0&169&0\\0&112&1\end{bmatrix}}} </td><td></td><td>u8,7 = u3,12</td><td>u8,7d = dc8,7</td><td>du8,7 = c8,7d</td><td>c8,7 = c3,12</td></tr><tr><td>9</td><td>8</td><td>III</td><td>217</td><td> [ 1 72 0 0 217 0 0 144 1 ] {\displaystyle {\begin{bmatrix}1&72&0\\0&217&0\\0&144&1\end{bmatrix}}} </td><td></td><td>u9,8 = u2,1u5,1</td><td>u9,8d = dc9,8</td><td>du9,8 = c9,8d</td><td>c9,8 = c2,1c5,1</td></tr><tr><td colspan="2"> a ≡ b {\displaystyle a\equiv b}   ( m o d   3 ) {\displaystyle \ (\mathrm {mod} \ 3)} </td><td>I, II, or III</td><td> T ≡ 0   {\displaystyle T\equiv 0\ } ( m o d   3 ) {\displaystyle (\mathrm {mod} \ 3)} </td><td> [ 1 T 3 − 1 1 0 T 0 0 2 3 T 0 ] {\displaystyle {\begin{bmatrix}1&{\frac {T}{3}}-1&1\\0&T&0\\0&{\frac {2}{3}}T&0\end{bmatrix}}} </td><td>...</td><td>ua,b</td><td>ua,bd = dca,b</td><td>dua,b = ca,bd</td><td>ca,b</td></tr><tr><td colspan="2"> a ≢ b {\displaystyle a\not \equiv b}   ( m o d   3 ) {\displaystyle \ (\mathrm {mod} \ 3)} </td><td>I or III</td><td> T ≡ 1 {\displaystyle T\equiv 1}   ( m o d   3 ) {\displaystyle \ (\mathrm {mod} \ 3)} </td><td> [ 1 T − 1 3 0 0 T 0 0 2 T − 1 3 1 ] {\displaystyle {\begin{bmatrix}1&{\frac {T-1}{3}}&0\\0&T&0\\0&2{\frac {T-1}{3}}&1\end{bmatrix}}} </td><td>...</td><td>ua,b</td><td>ua,bd = dca,b</td><td>dua,b = ca,bd</td><td>ca,b</td></tr></tbody></table>
By basic number theory, for any values of a and b, 
 
 
 
 T
 ≢
 2
  
 (
 
 m
 o
 d
 
  
 3
 )
 
 
 {\displaystyle T\not \equiv 2\ (\mathrm {mod} \ 3)}
 
.

<h4>Quadrilateral</h4>
Quadrilateral Goldberg-Coxeter operators<table><tbody><tr><th>a</th><th>b</th><th>Class</th><th>Edge factor T = a2 + b2</th><th>Matrix M x {\displaystyle \mathbf {M} _{x}} </th><th>Master square</th><th>x</th><th>xd</th><th>dx</th><th>dxd</th></tr><tr><td>1</td><td>0</td><td>I</td><td>1</td><td> [ 1 0 0 0 1 0 0 0 1 ] {\displaystyle {\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}}} </td><td></td><td>o1 = S</td><td colspan="2">e1 = d</td><td>o1 = dd = S</td></tr><tr><td>2</td><td>0</td><td>I</td><td>4</td><td> [ 1 1 1 0 4 0 0 2 0 ] {\displaystyle {\begin{bmatrix}1&1&1\\0&4&0\\0&2&0\end{bmatrix}}} </td><td></td><td colspan="2">o2 = o = j2</td><td colspan="2">e2 = e = a2</td></tr><tr><td>3</td><td>0</td><td>I</td><td>9</td><td> [ 1 4 0 0 9 0 0 4 1 ] {\displaystyle {\begin{bmatrix}1&4&0\\0&9&0\\0&4&1\end{bmatrix}}} </td><td></td><td>o3</td><td colspan="2">e3</td><td>o3</td></tr><tr><td>4</td><td>0</td><td>I</td><td>16</td><td> [ 1 7 1 0 16 0 0 8 0 ] {\displaystyle {\begin{bmatrix}1&7&1\\0&16&0\\0&8&0\end{bmatrix}}} </td><td></td><td colspan="2">o4 = oo = j4</td><td colspan="2">e4 = ee = a4</td></tr><tr><td>5</td><td>0</td><td>I</td><td>25</td><td> [ 1 12 0 0 25 0 0 12 1 ] {\displaystyle {\begin{bmatrix}1&12&0\\0&25&0\\0&12&1\end{bmatrix}}} </td><td></td><td>o5 = o2,1o1,2 = prp</td><td colspan="2">e5 = e2,1e1,2</td><td>o5= dprpd</td></tr><tr><td>6</td><td>0</td><td>I</td><td>36</td><td> [ 1 17 1 0 36 0 0 18 0 ] {\displaystyle {\begin{bmatrix}1&17&1\\0&36&0\\0&18&0\end{bmatrix}}} </td><td></td><td colspan="2">o6 = o2o3</td><td colspan="2">e6 = e2e3</td></tr><tr><td>7</td><td>0</td><td>I</td><td>49</td><td> [ 1 24 0 0 49 0 0 24 1 ] {\displaystyle {\begin{bmatrix}1&24&0\\0&49&0\\0&24&1\end{bmatrix}}} </td><td></td><td>o7</td><td colspan="2">e7</td><td>o7</td></tr><tr><td>8</td><td>0</td><td>I</td><td>64</td><td> [ 1 31 1 0 64 0 0 32 0 ] {\displaystyle {\begin{bmatrix}1&31&1\\0&64&0\\0&32&0\end{bmatrix}}} </td><td></td><td colspan="2">o8 = o3 = j6</td><td colspan="2">e8 = e3 = a6</td></tr><tr><td>9</td><td>0</td><td>I</td><td>81</td><td> [ 1 40 0 0 81 0 0 40 1 ] {\displaystyle {\begin{bmatrix}1&40&0\\0&81&0\\0&40&1\end{bmatrix}}} </td><td></td><td>o9 = o32</td><td colspan="2">e9 = e32</td><td>o9</td></tr><tr><td>10</td><td>0</td><td>I</td><td>100</td><td> [ 1 49 1 0 100 0 0 50 0 ] {\displaystyle {\begin{bmatrix}1&49&1\\0&100&0\\0&50&0\end{bmatrix}}} </td><td></td><td colspan="2">o10 = oo2,1o1,2</td><td colspan="2">e10 = ee2,1e1,2</td></tr><tr><td>1</td><td>1</td><td>II</td><td>2</td><td> [ 1 0 1 0 2 0 0 1 0 ] {\displaystyle {\begin{bmatrix}1&0&1\\0&2&0\\0&1&0\end{bmatrix}}} </td><td></td><td colspan="2">o1,1 = j</td><td colspan="2">e1,1 = a</td></tr><tr><td>2</td><td>2</td><td>II</td><td>8</td><td> [ 1 3 1 0 8 0 0 4 0 ] {\displaystyle {\begin{bmatrix}1&3&1\\0&8&0\\0&4&0\end{bmatrix}}} </td><td></td><td colspan="2">o2,2 = j3</td><td colspan="2">e2,2 = a3</td></tr><tr><td>1</td><td>2</td><td>III</td><td>5</td><td> [ 1 2 0 0 5 0 0 2 1 ] {\displaystyle {\begin{bmatrix}1&2&0\\0&5&0\\0&2&1\end{bmatrix}}} </td><td></td><td>o1,2 = p</td><td colspan="2">e1,2 = dp = pd</td><td>p</td></tr><tr><td colspan="2"> a ≡ b {\displaystyle a\equiv b}   ( m o d   2 ) {\displaystyle \ (\mathrm {mod} \ 2)} </td><td>I, II, or III</td><td>T even</td><td> [ 1 T 2 − 1 1 0 T 0 0 T 2 0 ] {\displaystyle {\begin{bmatrix}1&{\frac {T}{2}}-1&1\\0&T&0\\0&{\frac {T}{2}}&0\end{bmatrix}}} </td><td>...</td><td colspan="2">oa,b</td><td colspan="2">ea,b</td></tr><tr><td colspan="2"> a ≢ b {\displaystyle a\not \equiv b}   ( m o d   2 ) {\displaystyle \ (\mathrm {mod} \ 2)} </td><td>I or III</td><td>T odd</td><td> [ 1 T − 1 2 0 0 T 0 0 T − 1 2 1 ] {\displaystyle {\begin{bmatrix}1&{\frac {T-1}{2}}&0\\0&T&0\\0&{\frac {T-1}{2}}&1\end{bmatrix}}} </td><td>...</td><td>oa,b</td><td colspan="2">ea,b</td><td>oa,b</td></tr></tbody></table>
<h2 id="examples">Examples</h2>
See also: <a href="/facts/List_of_geodesic_polyhedra_and_Goldberg_polyhedra/w9Cv5kzF">List of geodesic polyhedra and Goldberg polyhedra</a>
<h3>Archimedean and Catalan solids</h3>
Conway's original set of operators can create all of the <a href="/facts/Archimedean_solids/wYWeHDYT">Archimedean solids</a> and <a href="/facts/Catalan_solids/R8D2cP7D">Catalan solids</a>, using the <a href="/facts/Platonic_solids/jraREXFD">Platonic solids</a> as seeds. (Note that the r operator is not necessary to create both chiral forms.)

<h3>Composite operators</h3>
The <a href="/facts/Truncated_icosahedron/LR8ugaY9">truncated icosahedron</a>, tI, can be used as a seed to create some more visually-pleasing polyhedra, although these are neither <a href="/facts/Vertex_transitive/5nC8PdBm">vertex</a> nor <a href="/facts/Face-transitive/ukLVQlK2">face-transitive</a>.

<h3>On the plane</h3>
Each of the <a href="/facts/List_of_convex_uniform_tilings/c1ALUDMm">convex uniform tilings</a> and their duals can be created by applying Conway operators to the <a href="/facts/Regular_tilings/Kng25Ymq">regular tilings</a> Q, H, and Δ.

<h3>On a torus</h3>
Conway operators can also be applied to <a href="/facts/Toroidal_polyhedra/g6SS84k2">toroidal polyhedra</a> and polyhedra with multiple holes.

Wikimedia Commons has media related to Conway polyhedra.

<ul><li><a href="/facts/Symmetrohedron/ovKnlENh">Symmetrohedron</a></li>
<li><a href="/facts/Zonohedron/w16kH9H3">Zonohedron</a></li>
<li><a href="/facts/Schl%25C3%25A4fli_symbol/jNQR77UU">Schläfli symbol</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="https://levskaya.github.io/polyhedronisme/">polyHédronisme</a>: generates polyhedra in HTML5 canvas, taking Conway notation as input</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Conway, John; Burgiel, Heidi; Goodman-Strauss, Chaim (2008). "Chapter 21: Naming Archimedean and Catalan polyhedra and tilings". The Symmetries of Things. AK Peters. p. 288. ISBN 978-1-56881-220-5. <a href="978-1-56881-220-5" target="_blank">978-1-56881-220-5</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Weisstein, Eric W. "Conway Polyhedron Notation". MathWorld. <a href="/wiki/Eric_W._Weisstein" target="_blank">/wiki/Eric_W._Weisstein</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">George W. Hart (1998). "Conway Notation for Polyhedra". Virtual Polyhedra. <a href="http://www.georgehart.com/virtual-polyhedra/conway_notation.html" target="_blank">http://www.georgehart.com/virtual-polyhedra/conway_notation.html</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Adrian Rossiter. "conway - Conway Notation transformations". Antiprism Polyhedron Modelling Software. <a href="http://www.antiprism.com/programs/conway.html" target="_blank">http://www.antiprism.com/programs/conway.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Anselm Levskaya. "polyHédronisme". <a href="https://levskaya.github.io/polyhedronisme/" target="_blank">https://levskaya.github.io/polyhedronisme/</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Hart, George (1998). "Conway Notation for Polyhedra". Virtual Polyhedra. (See fourth row in table, "a = ambo".) <a href="http://www.georgehart.com/virtual-polyhedra/conway_notation.html" target="_blank">http://www.georgehart.com/virtual-polyhedra/conway_notation.html</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Brinkmann, G.; Goetschalckx, P.; Schein, S. (2017). "Goldberg, Fuller, Caspar, Klug and Coxeter and a general approach to local symmetry-preserving operations". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473 (2206): 20170267. arXiv:1705.02848. Bibcode:2017RSPSA.47370267B. doi:10.1098/rspa.2017.0267. S2CID 119171258. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Goetschalckx, Pieter; Coolsaet, Kris; Van Cleemput, Nico (2020-04-12). "Generation of Local Symmetry-Preserving Operations". arXiv:1908.11622 [math.CO]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Goetschalckx, Pieter; Coolsaet, Kris; Van Cleemput, Nico (2020-04-11). "Local Orientation-Preserving Symmetry Preserving Operations on Polyhedra". arXiv:2004.05501 [math.CO]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Hart, George (1998). "Conway Notation for Polyhedra". Virtual Polyhedra. (See fourth row in table, "a = ambo".) <a href="http://www.georgehart.com/virtual-polyhedra/conway_notation.html" target="_blank">http://www.georgehart.com/virtual-polyhedra/conway_notation.html</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Brinkmann, G.; Goetschalckx, P.; Schein, S. (2017). "Goldberg, Fuller, Caspar, Klug and Coxeter and a general approach to local symmetry-preserving operations". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473 (2206): 20170267. arXiv:1705.02848. Bibcode:2017RSPSA.47370267B. doi:10.1098/rspa.2017.0267. S2CID 119171258. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Goetschalckx, Pieter; Coolsaet, Kris; Van Cleemput, Nico (2020-04-12). "Generation of Local Symmetry-Preserving Operations". arXiv:1908.11622 [math.CO]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Weisstein, Eric W. "Rectification". MathWorld. <a href="/wiki/Eric_W._Weisstein" target="_blank">/wiki/Eric_W._Weisstein</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Weisstein, Eric W. "Cumulation". MathWorld. <a href="/wiki/Eric_W._Weisstein" target="_blank">/wiki/Eric_W._Weisstein</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Weisstein, Eric W. "Truncation". MathWorld. <a href="/wiki/Eric_W._Weisstein" target="_blank">/wiki/Eric_W._Weisstein</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">George W. Hart (1998). "Conway Notation for Polyhedra". Virtual Polyhedra. <a href="http://www.georgehart.com/virtual-polyhedra/conway_notation.html" target="_blank">http://www.georgehart.com/virtual-polyhedra/conway_notation.html</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">"Antiprism - Chirality issue in conway". <a href="https://groups.google.com/forum/#!topic/antiprism/6NcYnKP4mTc" target="_blank">https://groups.google.com/forum/#!topic/antiprism/6NcYnKP4mTc</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Livio Zefiro (2008). "Generation of an icosahedron by the intersection of five tetrahedra: geometrical and crystallographic features of the intermediate polyhedra". Vismath. <a href="http://www.mi.sanu.ac.rs/vismath/zefiro2008/__generation_of_icosahedron_by_5tetrahedra.htm" target="_blank">http://www.mi.sanu.ac.rs/vismath/zefiro2008/__generation_of_icosahedron_by_5tetrahedra.htm</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">George W. Hart (August 2000). Sculpture based on Propellorized Polyhedra. Proceedings of MOSAIC 2000. Seattle, WA. pp. 61–70. <a href="http://www.georgehart.com/propello/propello.html" target="_blank">http://www.georgehart.com/propello/propello.html</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">Adrian Rossiter. "conway - Conway Notation transformations". Antiprism Polyhedron Modelling Software. <a href="http://www.antiprism.com/programs/conway.html" target="_blank">http://www.antiprism.com/programs/conway.html</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Adrian Rossiter. "conway - Conway Notation transformations". Antiprism Polyhedron Modelling Software. <a href="http://www.antiprism.com/programs/conway.html" target="_blank">http://www.antiprism.com/programs/conway.html</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Adrian Rossiter. "conway - Conway Notation transformations". Antiprism Polyhedron Modelling Software. <a href="http://www.antiprism.com/programs/conway.html" target="_blank">http://www.antiprism.com/programs/conway.html</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Adrian Rossiter. "conway - Conway Notation transformations". Antiprism Polyhedron Modelling Software. <a href="http://www.antiprism.com/programs/conway.html" target="_blank">http://www.antiprism.com/programs/conway.html</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Deza, M.; Dutour, M (2004). "Goldberg–Coxeter constructions for 3-and 4-valent plane graphs". The Electronic Journal of Combinatorics. 11: #R20. doi:10.37236/1773. <a href="/wiki/Michel_Deza" target="_blank">/wiki/Michel_Deza</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Deza, M.-M.; Sikirić, M. D.; Shtogrin, M. I. (2015). "Goldberg–Coxeter Construction and Parameterization". Geometric Structure of Chemistry-Relevant Graphs: Zigzags and Central Circuits. Springer. pp. 131–148. ISBN 9788132224495. <a href="9788132224495" target="_blank">9788132224495</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Brinkmann, G.; Goetschalckx, P.; Schein, S. (2017). "Goldberg, Fuller, Caspar, Klug and Coxeter and a general approach to local symmetry-preserving operations". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473 (2206): 20170267. arXiv:1705.02848. Bibcode:2017RSPSA.47370267B. doi:10.1098/rspa.2017.0267. S2CID 119171258. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
</ol>

Conway polyhedron notation open-in-new

Conway polyhedron notation