diff --git a/posts/pentagons/1/index.qmd b/posts/pentagons/1/index.qmd
index 73edb33..7834ee6 100644
--- a/posts/pentagons/1/index.qmd
+++ b/posts/pentagons/1/index.qmd
@@ -633,7 +633,7 @@ goldberg_classes = {
),
GoldbergData(
parameter=(4, 1),
- conway="tdwD",
+ conway="dkwD",
conway_recipe="K300tdwD",
),
],
diff --git a/posts/pentagons/3/f6 = 18 tatami.png b/posts/pentagons/3/18_hexagon_tatami.png
similarity index 100%
rename from posts/pentagons/3/f6 = 18 tatami.png
rename to posts/pentagons/3/18_hexagon_tatami.png
diff --git a/posts/pentagons/3/dodecahedron tatami.png b/posts/pentagons/3/dodecahedron_tatami.png
similarity index 100%
rename from posts/pentagons/3/dodecahedron tatami.png
rename to posts/pentagons/3/dodecahedron_tatami.png
diff --git a/posts/pentagons/3/drajmarsh - t5t6dwdzC.png b/posts/pentagons/3/drajmarsh_t5t6dwdzC.png
similarity index 100%
rename from posts/pentagons/3/drajmarsh - t5t6dwdzC.png
rename to posts/pentagons/3/drajmarsh_t5t6dwdzC.png
diff --git a/posts/pentagons/3/drajmarsh - t5t6uzC.png b/posts/pentagons/3/drajmarsh_t5t6uzC.png
similarity index 100%
rename from posts/pentagons/3/drajmarsh - t5t6uzC.png
rename to posts/pentagons/3/drajmarsh_t5t6uzC.png
diff --git a/posts/pentagons/3/drajmarsh - t5zC.png b/posts/pentagons/3/drajmarsh_t5zC.png
similarity index 100%
rename from posts/pentagons/3/drajmarsh - t5zC.png
rename to posts/pentagons/3/drajmarsh_t5zC.png
diff --git a/posts/pentagons/3/drajmarsh - zC.png b/posts/pentagons/3/drajmarsh_zC.png
similarity index 100%
rename from posts/pentagons/3/drajmarsh - zC.png
rename to posts/pentagons/3/drajmarsh_zC.png
diff --git a/posts/pentagons/3/third of frustum.png b/posts/pentagons/3/frustum_third.png
similarity index 100%
rename from posts/pentagons/3/third of frustum.png
rename to posts/pentagons/3/frustum_third.png
diff --git a/posts/pentagons/3/index.qmd b/posts/pentagons/3/index.qmd
index 05b38fe..dd24fdb 100644
--- a/posts/pentagons/3/index.qmd
+++ b/posts/pentagons/3/index.qmd
@@ -1,258 +1,491 @@
---
+title: "12 Pentagons, Part 3"
+description: |
+ Exploring even more symmetries based on the 12 pentagons condition.
format:
html:
html-math-method: katex
jupyter: python3
+date: "2021-06-09"
+date-modified: "2025-03-16"
+categories:
+ - geometry
+ - combinatorics
+ - symmetry
+# Get rid of the figure label
+crossref:
+ fig-title: ""
+ fig-labels: " "
+ tbl-title: ""
+ tbl-labels: " "
+ title-delim: ""
+ custom:
+ - key: fig
+ kind: float
+ reference-prefix: Figure
+ space-before-numbering: false
+ - key: tbl
+ kind: float
+ reference-prefix: Table
+ space-before-numbering: false
---
+
-12 Pentagons, Part 3
-====================
This is the third part in an investigation into answering the following question:
-> A soccer ball is a (roughly spherical) figure made of pentagons and hexagons, each meeting 3 at a point. [T]here are 12 pentagons...how many hexagons can there be?
+> A soccer ball is a (roughly spherical) figure made of pentagons and hexagons, each meeting 3 at a point.
+ [T]here are 12 pentagons...how many hexagons can there be?
-The [first post]() in the series proved the 12 pentagons portion and investigated (dodecahedral) Goldberg polyhedra. The [second post]() investigated (tetrahedral) Goldberg polyhedra as well as other tetrahedral solutions. Yet more unconventional solutions are presented below.
+The [first post](../1) in the series proved the 12 pentagons portion and investigated
+ (dodecahedral) Goldberg polyhedra.
+The [second post](../2) investigated tetrahedral Goldberg polyhedra as well as other tetrahedral solutions.
+Yet more unconventional solutions are presented below.
-Introduction
-------------
+Combinatorics of Goldberg-Coxeter Operators
+-------------------------------------------
+In the last post, it was discovered that certain solutions cannot be created easily from seed polyhedra
+ in a polyhedron viewer.
+This prompts the question of how to calculate the vertex, edge, and face counts
+ without acquiring them from the output of such a program.
-### Combinatorics of Goldberg-Coxeter Operators
-
-I mentioned previously that these solutions cannot be created easily from seed polyhedra in a polyhedron viewer. This prompts the question of how to calculate the vertex, edge, and face counts without acquiring them from the output of such a program.
-
-Each of the simple GC operators (*dk*, *c*, and *w*) has a combinatoric matrix form when applied to a vector of the vertex, edge, and face counts of a figure S.
+Each of the simple GC operators (*c*, *dk*, and *w*) has a combinatoric matrix form
+ when applied to a vector of the vertex, edge, and face counts of a figure *S*.
$$
-S = \begin{pmatrix} v \\ e \\ f \end{pmatrix} = \begin{pmatrix} 2F_6 + 20 \\ 3F_6 + 30 \\ F_6 + 12 \end{pmatrix} \\
-dk = \begin{pmatrix} 0 & 2 & 0 \\ 0 & 3 & 0 \\ 1 & 0 & 1 \end{pmatrix}, ~
-c = \begin{pmatrix} 1 & 2 & 0 \\ 0 & 4 & 0 \\ 0 & 1 & 1 \end{pmatrix}, ~
-w = \begin{pmatrix} 1 & 4 & 0 \\ 0 & 7 & 0 \\ 0 & 2 & 1 \end{pmatrix}
+\begin{gather*}
+ S = \begin{pmatrix} v \\ e \\ f \end{pmatrix}
+ = \begin{pmatrix}
+ 2F_6 + 20 \\
+ 3F_6 + 30 \\
+ F_6 + 12
+ \end{pmatrix}
+ = \begin{pmatrix} 2 \\ 3 \\ 1 \end{pmatrix} F_6
+ + \begin{pmatrix} 20 \\ 30 \\ 12 \end{pmatrix} \\
+ \underset{
+ \text{Class I}
+ }{
+ c = \begin{pmatrix}
+ 1 & 2 & 0 \\
+ 0 & 4 & 0 \\
+ 0 & 1 & 1
+ \end{pmatrix}
+ } \quad
+ \underset{
+ \text{Class II}
+ }{
+ dk = \begin{pmatrix}
+ 0 & 2 & 0 \\
+ 0 & 3 & 0 \\
+ 1 & 0 & 1
+ \end{pmatrix}
+ } \quad
+ \underset{
+ \text{Class III}
+ }{
+ w = \begin{pmatrix}
+ 1 & 4 & 0 \\
+ 0 & 7 & 0 \\
+ 0 & 2 & 1
+ \end{pmatrix}
+ }
+\end{gather*}
$$
-As a reminder, *tk* is a power of the *dk* operator. Powers of a matrix are more readily expressed when the matrix is diagonalized.
+These operators are labelled with the classes of Goldberg polyhedra they construct
+ when applied to the dodecahedron.
+
+- *cD* = GC(2, 0)
+- *dkD* = *tI* = GC(1, 1)
+- *wD* = GC(2, 1)
+
+It's worth noting again that *dk* alternates between producing Class I and Class II solutions.
+
+
+### Diagonalization
+
+*tk* is the square of the *dk* operator.
+Unlike it, it preserves solution class.
+Powers of a matrix are more readily expressed when the matrix is diagonalized.
+We can diagonalize each of these operators to notice something they have in common.
$$
\begin{align*}
-dk &= \begin{pmatrix} 0 & 2 & 0 \\ 0 & 3 & 0 \\ 1 & 0 & 1 \end{pmatrix} =
-\begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} 0 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 3 \end{pmatrix}
-\begin{pmatrix} 1 & -2/3 & 0 \\ 1 & -1 & 1 \\ 0 & 1/3 & 0 \end{pmatrix}
-\\
-c &= \begin{pmatrix} 1 & 2 & 0 \\ 0 & 4 & 0 \\ 0 & 1 & 1 \end{pmatrix} =
-\begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 4 \end{pmatrix}
-\begin{pmatrix} 1 & -2/3 & 0 \\ 1 & -1 & 1 \\ 0 & 1/3 & 0 \end{pmatrix}
-\\
-w &= \begin{pmatrix} 1 & 4 & 0 \\ 0 & 7 & 0 \\ 0 & 2 & 1 \end{pmatrix} =
-\begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 7 \end{pmatrix}
-\begin{pmatrix} 1 & -2/3 & 0 \\ 1 & -1 & 1 \\ 0 & 1/3 & 0 \end{pmatrix}
+ c &= \begin{pmatrix}
+ 1 & 2 & 0 \\
+ 0 & 4 & 0 \\
+ 0 & 1 & 1
+ \end{pmatrix}
+ = \textcolor{red}{
+ \begin{pmatrix}
+ -1 & 0 & 2 \\
+ 0 & 0 & 3 \\
+ 1 & 1 & 1
+ \end{pmatrix}
+ }
+ \begin{pmatrix}
+ 1 & 0 & 0 \\
+ 0 & 1 & 0 \\
+ 0 & 0 & 4
+ \end{pmatrix}
+ \textcolor{blue}{
+ \begin{pmatrix}
+ 1 & -2/3 & 0 \\
+ 1 & -1 & 1 \\
+ 0 & 1/3 & 0
+ \end{pmatrix}
+ } \\
+ dk &= \begin{pmatrix}
+ 0 & 2 & 0 \\
+ 0 & 3 & 0 \\
+ 1 & 0 & 1
+ \end{pmatrix}
+ = \textcolor{red}{
+ \begin{pmatrix}
+ -1 & 0 & 2 \\
+ 0 & 0 & 3 \\
+ 1 & 1 & 1
+ \end{pmatrix}
+ }
+ \begin{pmatrix}
+ 0 & 0 & 0 \\
+ 0 & 1 & 0 \\
+ 0 & 0 & 3
+ \end{pmatrix}
+ \textcolor{blue}{
+ \begin{pmatrix}
+ 1 & -2/3 & 0 \\
+ 1 & -1 & 1 \\
+ 0 & 1/3 & 0
+ \end{pmatrix}
+ }
+ \\
+ w &= \begin{pmatrix}
+ 1 & 4 & 0 \\
+ 0 & 7 & 0 \\
+ 0 & 2 & 1
+ \end{pmatrix}
+ = \textcolor{red}{
+ \begin{pmatrix}
+ -1 & 0 & 2 \\
+ 0 & 0 & 3 \\
+ 1 & 1 & 1
+ \end{pmatrix}
+ }
+ \begin{pmatrix}
+ 1 & 0 & 0 \\
+ 0 & 1 & 0 \\
+ 0 & 0 & 7
+ \end{pmatrix}
+ \textcolor{blue}{
+ \begin{pmatrix}
+ 1 & -2/3 & 0 \\
+ 1 & -1 & 1 \\
+ 0 & 1/3 & 0
+ \end{pmatrix}
+ }
\end{align*}
$$
-All of these operators share the same eigenvectors. This means that composition of these operators only modifies the diagonal matrix, specifically the upper-left and lower-right eigenvalues. Note also that:
+All of these operators share the same eigenvectors, which can be seen
+ in the columns of the left outer matrix and rows of the right outer one.
+This means that composition of these operators only modifies the diagonal matrix,
+ specifically the upper-left and lower-right eigenvalues.
-- The (right) eigenvector (2, 3, 1), is shared by the general system governing the vertex, edge, and hexagon counts (simply look at the vector *S* to see this). In this system (not the one above), it has eigenvalue 0.
-- The left eigenvector (1, -1, 1) has eigenvalue 1, which corresponds to the Euler characteristic being maintained.
-- The left eigenvector, (3, -2, 0), when applied to general polyhedra corresponds to the edges and vertices added by the operation: *dk* forces all vertices to be degree-3 (hence the eigenvalue 0) and *c* and *w* maintain previous vertices while adding degree-3 ones (hence the eigenvalue 1).
+Some of these eigenvectors have special interpretations:
-All solutions share the same Euler characteristic and the condition 3V = 2E, so the rightmost multiplication simplifies things considerably.
+- The left eigenvector (1, -1, 1) (right matrix, middle row) always has eigenvalue 1.
+ - The operation does not change the Euler characteristic.
+- The left eigenvector (3, -2, 0) (right matrix, top row), when applied to general polyhedra
+ corresponds to the edges and vertices added by the operation:
+ - In *dk*, this vector has eigenvalue 0, forcing $3V = 2E$, i.e., all vertices to have degree 3.
+ - In *c* and *w*, this vector has eigenvalue 1. These operators only add degree-3 vertices.
+
+The (right) eigenvector (2, 3, 1), deserves special consideration.
+It happens to be the same as the $F_6$-dependent component of *S*.
+Its eigenvalue is different for the three operators --
+ 4 in the case of *c*, 3 in the case of *dk*, and 7 in the case of *w*.
+In all three cases, these coincide with the norm of the GC parameters:
+
+$$
+\begin{gather*}
+ cD = GC(2, 0) \longrightarrow \|2 + 0u\| = 2^2 + 2 \cdot 0 + 0^2 = 4 \\
+ dkD = GC(1, 1) \longrightarrow \|1 + 1u\| = 1^2 + 1 \cdot 1 + 1^2 = 3 \\
+ wD = GC(2, 1) \longrightarrow \|2 + 1u\| = 2^2 + 2 \cdot 1 + 1^2 = 7
+\end{gather*}
+$$
+
+Call this number $T = \|a + bu\| = a^2 + ab + b^2$.
+We know that integers of this form are never congruent to 2 (mod 3).
+Conveniently, this matches with the upper-left eigenvalue.
+
+Assuming for the sake of argument that this is true, it implies something interesting:
+ the GC operators produced from *T* are closed under multiplication.
+This captures all powers of a given *T*, as well as products between it and other possible *T*s.
+However, this combinatorial view misses some of the picture, since some feature counts
+ can be shared between two different classes at once.
+This comes down to the existence of chiral pairs.
+For example, [*ww*](https://levskaya.github.io/polyhedronisme/?recipe=K30wwD)
+ = $(2, 1) \circ (2, 1) = (5, 3)$,
+ but
+ [*ww'*](https://levskaya.github.io/polyhedronisme/?recipe=K30wrwD)
+ = $(2, 1) \circ (1, 2) = (7, 0)$.
+
+Ignoring this, it means we can characterize the possible hexagon counts given a certain *T*:
$$
\begin{align*}
-g_T S &= \begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} x & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & T \end{pmatrix}
-\begin{pmatrix} 1 & -{2 \over 3} & 0 \\ 1 & -1 & 1 \\ 0 & {1 \over 3} & 0 \end{pmatrix}
-\begin{pmatrix} v \\ e \\ f \end{pmatrix}
-\\[8pt] &=
-\begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} x & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & T \end{pmatrix}
-\begin{pmatrix} v - {2 \over 3} e = 0 \\ v - e + f = 2 \\ {1 \over 3} e \end{pmatrix}
-\\[8pt] &=
-\begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} 0 \\ 2 \\ {1 \over 3} T e \end{pmatrix}
+ g_T S &= \begin{pmatrix}
+ -1 & 0 & 2 \\
+ 0 & 0 & 3 \\
+ 1 & 1 & 1
+ \end{pmatrix}
+ \begin{pmatrix}
+ x & 0 & 0 \\
+ 0 & 1 & 0 \\
+ 0 & 0 & T
+ \end{pmatrix}
+ \begin{pmatrix}
+ 1 & -{2 \over 3} & 0 \\
+ 1 & -1 & 1 \\
+ 0 & {1 \over 3} & 0
+ \end{pmatrix}
+ \begin{pmatrix} v \\ e \\ f \end{pmatrix} \\[8pt]
+ &=
+ \begin{pmatrix}
+ -1 & 0 & 2 \\
+ 0 & 0 & 3 \\
+ 1 & 1 & 1
+ \end{pmatrix}
+ \begin{pmatrix}
+ x & 0 & 0 \\
+ 0 & 1 & 0 \\
+ 0 & 0 & T
+ \end{pmatrix}
+ \begin{pmatrix}
+ v - {2 \over 3} e = 0 \\
+ v - e + f = 2 \\
+ {1 \over 3} e = F_6 + 10
+ \end{pmatrix} \\[8pt]
+ &=
+ \begin{pmatrix}
+ -1 & 0 & 2 \\
+ 0 & 0 & 3 \\
+ 1 & 1 & 1
+ \end{pmatrix}
+ \begin{pmatrix} 0 \\ 2 \\ T (F_6 + 10) \end{pmatrix} \\
+ &=
+ \begin{pmatrix} T(2F_6 + 20) \\ T(3F_6 + 30) \\ T(F_6 + 10) + 2 \end{pmatrix} \\[8pt]
+ F'_6 &= T(F_6 + 10) - 10
\end{align*}
$$
-Recall that each of the operators applied to the dodecahedron was a Goldberg polyhedron: *dkD* = *tI* = GC(1, 1), *cD* = GC(2, 0), and *wD* = GC(2, 1). The norm of each of these is 3, 4, and 7 respectively, which is also the eigenvalue T. In fact, all Goldberg-Coxeter operators, not just compositions of these three, simply set $T = \|a + bu\|$ (the eigenvalue x is T mod 3, which as previously mentioned, is never congruent to 2).
-
-This eigenvalue problem also implies something about the possible values of *T*: it is closed under multiplication. For any *T*, all its powers are *also* possible *T*, as are products between *T*. In fact, the existence of chiral pairs ($a \neq b$) and the ability to compose opposites is what can make *T* nonunique for a given pair (e.g.: $ww = (2, 1) \odot (2, 1) = (5, 3)$, but $ww' = (2, 1) \odot (1, 2) = (7, 0)$).
-
-Returning to the equation,
-
-$$
-\begin{align*}
-\begin{pmatrix} -1 & 0 & 2 \\ 0 & 0 & 3 \\ 1 & 1 & 1 \end{pmatrix}
-\begin{pmatrix} 0 \\ 2 \\ {1 \over 3} T e \end{pmatrix} &=
-\begin{pmatrix} {2 \over 3} Te \\ Te \\ {1 \over 3}Te + 2 \end{pmatrix}
-\\[8pt] &=
-\begin{pmatrix} {2 \over 3} T(3F_6 + 30) \\ T(3F_6 + 30) \\ {1 \over 3}T(3F_6 + 30) + 2 \end{pmatrix}
-\\[8pt] &=
-\begin{pmatrix} 2T(F_6 + 10) \\ 3T(F_6 + 10) \\ T(F_6 + 10) + 2 \end{pmatrix}
-\\[12pt]
-F'_6 &= T(F_6 + 10) - 10
-\end{align*}
-$$
-
-This demonstrates the importance of both the constructed base solution figure *S* with $F_6$ hexagons and the possible values of *T*.
+This demonstrates two things: the initial $F_6$ count from the choice of seed polygon *S* matters,
+ and the possible values of *T* can be used to grow this sequence
-### A brief word about Symmetry
+Searching for Other Seeds
+-------------------------
-The dodecahedron, and by extension dodecahedral solutions, have icosahedral symmetry. A sub-symmetry of this, being tetrahedral symmetry, was exploited in the previous post. However, there are further sub-symmetries which have not been encountered. For example, some "smaller" symmetries of the dodecahedron are the vertices under rotation and inversion (dihedral, degree 3) and the faces under rotation and inversion (dihedral, degree 5). One of these two symmetries must be shared by a solution.
+The dodecahedron, and by extension dodecahedral solutions, have icosahedral symmetry.
+Tetrahedral symmetry, a sub-symmetry of this, was exploited in the previous post.
-Rather than the typical construction based on paths between pentagons, this section will focus on certain base cases followed by a rudimentary application of the Conway operators above. The particular symmetry group of each figure will be mentioned in each section.
+However, there are further sub-symmetries which have not been encountered.
+For example, some lesser symmetries of the dodecahedron are the vertices under rotation
+ and inversion ([dihedral](https://en.wikipedia.org/wiki/Dihedral_group), degree 3)
+ and the faces under rotation and inversion (dihedral, degree 5).
+
+Rather than the typical construction based on paths between pentagons,
+ this section will focus on certain base cases followed by a rudimentary application
+ of the Conway operators above.
+The particular symmetry group of each figure will be mentioned in each section.
-Deltahedra
-----------
+### Degenerate Deltahedra
-*Deltahedra* are polyhedra formed by equilateral triangles, a [table of which](https://en.wikipedia.org/wiki/Deltahedron) is available on Wikipedia. Equilateral triangles are important since three to five of them can be joined at a convex vertex, and if coplanar arrangements are allowed, up to six of them. Degree-5 and degree-6 vertices can be dualized or truncated to pentagons and hexagons respectively; additionally, if the former operation is used, then the triangles become degree-3 vertices.
+*Deltahedra* are polyhedra formed by equilateral triangles,
+ a [table of which](https://en.wikipedia.org/wiki/Deltahedron) is available on Wikipedia.
+Equilateral triangles are important since three to five of them can be joined at a convex vertex,
+ and if coplanar arrangements are allowed, up to six.
+Degree-5 and degree-6 vertices can be dualized or truncated to pentagons and hexagons respectively.
+Additionally, when dualizing, all of the triangles become degree-3 vertices, producing a solution.
-All convex deltahedra besides the tetrahedron and the icosahedron contain degree-4 vertices. These pose a problem since they become quadrilaterals. Though selective (pyramidal) augmentation can correct these vertices to degree-5 (and those of degree-5 to degree-6), this section will focus on the coplanar entries on the table.
+All convex deltahedra besides the tetrahedron and icosahedron contain degree-4 vertices.
+These vertices pose a problem since their duals are quadrilaterals.
+However, it's reasonably easy to "correct" these vertices to a higher degree
+ by selectively raising pyramids on faces (*augmenting*).
+This section will focus on the coplanar entries on the table.
-### Triangulated Rhombohedron (Dih3)
+#### Triangulated Rhombohedron ($Dih_3$)
-The figure made by cutting the short diagonals of a *trigonal trapezohedron* (a rhombohedron like the cube) is one such degree-4 vertex-free deltahedron. It can also be seen as either a *biaugmentation* (by tetrahedra on opposite faces) of an octahedron or as a [*gyroelongated triangular bipyramid*](https://en.wikipedia.org/wiki/Gyroelongated_bipyramid). Truncating the order-5 vertices produces an eggy-looking figure, and one for which the polyhedron viewer I typically use refuses to comply. Try using this viewer (which unfortunately does not support hotlinking recipes) with the recipe t5z applied to the cube. This figure inherits the dihedral symmetry of degree 3 that the vertices of the dodecahedron have.
+
+The figure made by cutting the short diagonals of a
+ [rhombohedron](https://en.wikipedia.org/wiki/Rhombohedron)
+ is one such degree-4 vertex-free deltahedron.
+It can also be seen as the figure formed by adding two triangular pyramids
+ to opposite faces of an octahedron (a *biaugmentation*)
+ or as a [*gyroelongated triangular bipyramid*](https://en.wikipedia.org/wiki/Gyroelongated_bipyramid).
-:::::: {layout-ncol=2}
-::::: {.column width="49%"}
-:::: {layout-ncol=2}
-::: {}
-
+Unfortunately, the polyhedron viewer I typically use is unsuitable for visualizing this figure.
+[This viewer](https://drajmarsh.bitbucket.io/poly3d.html)
+ supports more operations, and features an operator *z* which triangulates faces.
+It produces the desired figure when applied to the cube
+ (which is topologically equivalent to rhombohedra),
-Biaugmented octahedron
+Truncating the order-5 vertices produces an eggy-looking figure,
+It inherits the dihedral symmetry of degree 3 from the vertices of the dodecahedron.
+
+:::: {.row layout-ncol="2" layout-valign="center"}
+::: {.column .slim-column layout="[[1,1],[1]]"}
+
+
+
+
+
:::
-::: {}
-
+:::: {.column}
-Base case: order-5 truncation of left figure
-:::
-::::
-
-:::: {}
-
-
-Graph of the pole of the base case. On the opposite pole, blue and red hexagons are exchanged.
-::::
-:::::
-
-::::: {.column width="49%"}
-
-Conway | $F_6$ | V | E
---------|----------|-----|-----
-t5C = B | 6 | 32 | 48
-dkB | 38 | 96 | 144
-cB | 54 | 128 | 192
-wB | 102 | 224 | 336
-tkB | 134 | 288 | 432
-$g_T B$ | 16T - 10 | 32T | 48T
-
-:::::
-::::::
-
-
-### Triangular Frustum (Dih3)
-
-This figure is formed by a group of four triangles as a base, three half-hexagons on the edges, and closed by a triangle atop. It can also be seen as an augmented octahedron, but with the tetrahedra placed around a single face (a *triaugmentation*). Unfortunately, this figure is not easily constructible from normal seed polyhedra, even in the alternative viewer. However, it is still possible to operate on its projection as a planar graph. Truncating all vertices except those of degree 3 ($t_5 t_6$) produces a figure with 8 hexagons and indeed, 12 pentagons. In this case, the pentagons gather in groups of 4 and are separated by three bands of hexagons joined by two hexagons at either end. The symmetry inherited by this figure is also dihedral of degree 3, but centered about a hexagon, rather than a complex of pentagons.
-
-::::: {}
-:::: {layout-ncol="4"}
-::: {}
-
-:::
-
-::: {}
-
-:::
-
-::: {}
-
-:::
-
-::: {}
-
-:::
-::::
-Construction based on planar graph (1). First, the degree-6 vertices are truncated (2). Then, the graph is inverted (3) and the degree-5 vertices are truncated (4).
-:::::
-
-
-
-:::: {layout-ncol="2"}
-::: {.column width="49%"}
-
-
-One-third of the figure, showing a group of four pentagons. Pentagons in green, band hexagons in red, cap hexagons in blue.
-:::
-
-::: {.column width="49%"}
-
-Conway | $F_6$ | V | E
---------|----------|-----|-----
-F | 8 | 36 | 54
-dkF | 44 | 108 | 162
-cF | 62 | 144 | 216
-wF | 116 | 252 | 378
-tkF | 152 | 324 | 486
-$g_T F$ | 18T - 10 | 36T | 54T
+| Conway | $F_6$ | V | E |
+|---------|----------|-----|-----|
+| t5C = B | 6 | 32 | 48 |
+| dkB | 38 | 96 | 144 |
+| cB | 54 | 128 | 192 |
+| wB | 102 | 224 | 336 |
+| tkB | 134 | 288 | 432 |
+| $g_T B$ | 16T - 10 | 32T | 48T |
:::
::::
-***
-The remaining entries of the Wikipedia table with no degree-4 vertices (save the hexagonal antiprism, which I will discuss in the next section) are easily accessible from the tetrahedron. For example, the "augmented tetrahedron" is simply a subdivided tetrahedron (*uT*) and the "(subdivided) truncated tetrahedron" is the hexakis truncated tetrahedron ($k_6 tT$).
+#### Base-Triangulated Frustum ($Dih_3$)
-Larger subdivisions (in the $u_n$ sense) of the above two cases are also coplanar deltahedra, so this can be performed before the truncation. Triangular subdivision can add degree-6 vertices, so for the triangulated rhombohedron, an additional order-6 truncation needs to be done. Doing so means $t_5 t_6$ is applied to either case to form the solution figure.
+Consider two faces of a figure, one a single equilateral triangle and the other
+ containing four coplanar ones.
+These two faces can be joined by three triples of triangles in the shape of a half-hexagon.
+This figure can be seen as an octahedron with three tetrahedra placed around it (a *triaugmentation*),
+ or as triangulation of the triangular prism.
-An example subidivision is shown below. Note how the 3 pentagons at the pole have been separated from another 3 by a triangle of hexagons. I am fairly sure it is possible for mismatched pole configurations to be joined to one another for a more selective subdivision. Other Goldberg-Coxeter operations other than *u* can also be used; *dwd* for example connects non-polar pentagons with spirals of hexagons.
+Truncating all vertices except those of degree 3 ($t_5 t_6$) produces a figure
+ with 8 hexagons and indeed, 12 pentagons.
+Unfortunately, this figure is not easily constructible from normal seed polyhedra,
+ even in the alternative viewer.
+However, it is still possible to operate on its projection as a planar graph:
-::::: {}
-:::: {layout-ncol="2"}
-::: {.column width="49%"}
-
+::: {#fig-triangular-frustum layout-ncol="4"}
+
-$F_6$ = 60, V = 140, E = 210
+
+
+
+
+
:::
-::: {.column width="49%"}
-
+The pentagons gather in groups of 4 and are separated by three bands of hexagons,
+ joined by two hexagons at either end.
+The symmetry inherited by this figure is also dihedral of degree 3, but centered about a hexagon,
+ rather than (a complex of) pentagons.
+
+:::: {layout-ncol="2" layout-valign="center"}
+[
+{.column .slim-column}
+](./frustum_third.png){target="_blank"}
+
+::: {.column}
+
+| Conway | $F_6$ | V | E |
+|---------|----------|-----|-----|
+| F | 8 | 36 | 54 |
+| dkF | 44 | 108 | 162 |
+| cF | 62 | 144 | 216 |
+| wF | 116 | 252 | 378 |
+| tkF | 152 | 324 | 486 |
+| $g_T F$ | 18T - 10 | 36T | 54T |
-$F_6$ = 114, V = 248, E = 372
:::
::::
-Left: $t_5 t_6 uzC$, Right: $t_5 t_6 dwdzC$
-:::::
+#### Others
-Other Solutions
----------------
+Before their respective truncations, both of these figures of triangles which are compatible with
+ (dual) Goldberg-Coxeter operators.
+For example, larger triangular subdivisions (in the $u_n$ sense) will also give degenerate deltahedra,
+Triangular subdivision can add degree-6 vertices, so for the triangulated rhombohedron,
+ an additional order-6 truncation needs to be done.
+Doing so means $t_5 t_6$ is applied to either case to form the solution figure.
-This section is for polyhedra which are either more easily constructible or are not easily derived from deltahedra.
+An example subidivision is shown below.
+Note how the 3 pentagons at the pole have been separated from another 3 by a triangle of hexagons.
+I am fairly sure it is possible for mismatched pole configurations to be joined to one another
+ for a more selective subdivision.
+Other Goldberg-Coxeter operations other than *u* can also be used;
+ *dwd* for example connects non-polar pentagons with spirals of hexagons.
+::: {#fig-triangular-frustum-subdivision layout-ncol="2"}
+
-### Truncated Trapezohedron (Dih6)
-
-A *trapezohedron* is the polyhedral dual of an antiprism; an example is a d10, which is the pentagonal case. Despite the name "*n*-gonal trapezohedron," the figure is made entirely from 2*n* kites with the long edges meeting at points and the short edges meeting with each other. Truncating the order-*n* vertices where the long edges of the kites meet produces a truncated trapezohedron, which possesses two regular *n*-gonal "caps" separated by a ring of pentagons. In a way, they can be considered as the pentagonal analogue to prisms (quadrilaterals) and antiprisms (triangles).
-
-The dodecahedron itself can be realized as a (order-5) truncated pentagonal trapezohedron ($t_5 d A_5$), which emphasizes its degree-5 dihedral symmetry. The next largest truncated trapezohedron is the hexagonal case ($t_6 d A_6$), which contains and 2 hexagons and has dihedral symmetry of degree 6 (which itself contains that of degree 3).
-
-:::: {layout-ncol="2"}
-::: {.column width="49%"}
-
-
-Base case: truncated hexagonal trapezohedron
+
:::
-::: {.column width="49%"}
+
+### Truncated Trapezohedron ($Dih_6$)
+
+A *trapezohedron* is the polyhedral dual of an antiprism.
+An example is a d10, which is the [pentagonal case](https://en.wikipedia.org/wiki/Pentagonal_trapezohedron).
+Despite the name "*n*-gonal trapezohedron", the figure is made entirely from 2*n* kites
+ with the long edges meeting at points and the short edges meeting with each other.
+
+Truncating the order-*n* vertices where the long edges of the kites meet produces a
+ [truncated trapezohedron](https://en.wikipedia.org/wiki/Truncated_trapezohedron),
+These figures possess two regular *n*-gonal "caps" separated by a ring of pentagons.
+In a way, they can be considered as a pentagonal analogue to prisms (quadrilaterals)
+ and antiprisms (triangles).
+
+The dodecahedron itself can be realized as a (order-5) truncated pentagonal trapezohedron ($t_5 d A_5$),
+ which emphasizes its degree-5 dihedral symmetry.
+The next largest truncated trapezohedron is the hexagonal case ($t_6 d A_6$),
+ which contains and 2 hexagons and has dihedral symmetry of degree 6.
+This is a symmetry beyond that of the icosahedron, but exists due to the symmetry of the hexagon.
+
+:::: {layout-ncol="2" layout-valign="center"}
+
+
+::: {.column}
Conway | $F_6$ | V | E
-------------------------------------------------------------------------------|----------|-----|-----
@@ -266,213 +499,223 @@ $g_T T_6$ |
:::
::::
-Medially-Separated Dodecahedron (Dih5)
---------------------------------------
-As the "truncated pentagonal trapezohedron", the dodecahedron can be separated into halves along an equator (specifically, along the [Petrie polygon](https://en.wikipedia.org/wiki/Petrie_polygon)). This produces two halves with the pole configuration of the dodecahedron, joined together with hexagons. Organizing the pentagons into two pairs of 6 is similar to the earlier case with the triangulated cube, but with a different arrangement of pentagons. The resultant figure has dihedral symmetry of degree 5. Interestingly, it is also the first solution polyhedron with an odd number of faces.
+### Medially-Separated Dodecahedron ($Dih_5$)
+
+As the "truncated pentagonal trapezohedron", the dodecahedron can be separated into halves along an equator
+ (specifically, along the [Petrie polygon](https://en.wikipedia.org/wiki/Petrie_polygon)).
+This produces two halves with the pole configuration of the dodecahedron, joined together with hexagons.
+Organizing the pentagons into two pairs of 6 is similar to the earlier case with the triangulated cube,
+ but with a different arrangement of pentagons.
+The resultant figure has dihedral symmetry of degree 5.
-:::::: {layout-ncol="2"}
-::::: {.column width="49%"}
:::: {layout-ncol="2"}
-::: {.column width="49%"}
-
+::: {.column .slim-column layout="[[1,1],[1]]"}
+
-Dodecahedral graph
+
+
+
:::
-::: {.column width="49%"}
-
+::: {.column}
+
+| Conway | $F_6$ | V | E |
+|-----------------|----------|-----|-----|
+| $D_p$ | 5 | 30 | 45 |
+| $dkD_p$ | 35 | 90 | 135 |
+| $cD_p$ | 50 | 120 | 180 |
+| $wD_p$ | 95 | 210 | 315 |
+| $tkD_p$ | 125 | 270 | 405 |
+| $g_T D_p$ | 15T - 10 | 30T | 45T |
-Pole configuration of solution
:::
::::
-:::: {}
-
-
-Complete base solution. Note how the outer face has been rotated when compared with the dodecahedral graph
-::::
-:::::
-
-::::: {.column width="49%"}
-
-Conway | $F_6$ | V | E
-----------------|----------|-----|-----
-$D_p$ | 5 | 30 | 45
-$dkD_p$ | 35 | 90 | 135
-$cD_p$ | 50 | 120 | 180
-$wD_p$ | 95 | 210 | 315
-$tkD_p$ | 125 | 270 | 405
-$g_T D_p$ | 15T - 10 | 30T | 45T
-
-:::::
-::::::
+Interestingly, this is also the first solution polyhedron with an odd number of faces.
-Truncated Gyro-Pyramids (Dih5, Dih6)
-------------------------------------
+### Truncated Gyro-Pyramids ($Dih_5$, $Dih_6$)
-In the previous post, I used the Conway operator *g*, which is called "gyro". It is the dual operator to snubbing, intuition for which can be seen by looking at the [snub cube](https://en.wikipedia.org/wiki/Snub_cube). A *gyro-pyramid* (i.e., the gyro operator applied to pyramids) can roughly be described as a ring of 2*n* pentagons which alternate in orientation, the points of which have an additional edge connecting to one of two antipodal endpoints. Truncating these these adds a face with the same number of edges as the original pyramid, surrounded by hexagons. Solution polyhedra can be found by examining the pentagonal ($t_5 g Y_5$) and hexagonal ($t_6 g Y_6$) cases. The former has dihedral symmetry of degree 5 and the latter has that of degree 6 (which contains degree 3).
+*g*, for "gyro", is a Conway operator I have used, but refused to explain.
+A *gyro-pyramid* (i.e., the gyro operator applied to pyramids,
+ [example]](https://levskaya.github.io/polyhedronisme/?recipe=K300gY5))
+ can roughly be described as a ring of 2*n* pentagons which alternate in orientation,
+ the tips of which have an additional edge connecting to one of two antipodal endpoints.
+Truncating these endpoints these adds a face which is the same as the base of the original pyramid,
+ surrounded by hexagons.
-::::: {layout-ncol="2"}
-:::: {.column width="49%"}
-::: {}
-
+Solution polyhedra can be found by examining the pentagonal ($t_5 g Y_5$) and hexagonal ($t_6 g Y_6$) cases.
+The former has dihedral symmetry of degree 5 and the latter has that of degree 6.
-Base case 1: truncated pentagonal gyro-pyramid
+:::: {layout-ncol="2" layout-valign="center"}
+::: {.column .slim-column}
+
+
+
:::
-::: {}
-
+::: {.column}
+
+| Conway | $F_6$ | V | E |
+|-----------------------------------------------------------------------------------|----------|-----|-----|
+| [$t_5gY_5 = G_5$](https://levskaya.github.io/polyhedronisme/?recipe=K300t5K30gY5) | 10 | 40 | 60 |
+| [$dkG_5$](https://levskaya.github.io/polyhedronisme/?recipe=dkK300t5K30gY5) | 50 | 120 | 180 |
+| [$cG_5$](https://levskaya.github.io/polyhedronisme/?recipe=K300dudt5K30gY5) | 70 | 160 | 240 |
+| [$wG_5$](https://levskaya.github.io/polyhedronisme/?recipe=K300wK30t5K30gY5) | 130 | 280 | 420 |
+| [$tkG_5$](https://levskaya.github.io/polyhedronisme/?recipe=tkK300t5K30gY5) | 170 | 360 | 540 |
+| $g_T G_5$ | 20T - 10 | 40T | 60T |
+| [$t_6gY_6 = G_6$](https://levskaya.github.io/polyhedronisme/?recipe=K300t6K30gY6) | 14 | 48 | 72 |
+| [$dkG_6$](https://levskaya.github.io/polyhedronisme/?recipe=dkK300t6K30gY6) | 62 | 144 | 216 |
+| [$cG_6$](https://levskaya.github.io/polyhedronisme/?recipe=K300dudK40t6gY6) | 86 | 192 | 288 |
+| [$wG_6$](https://levskaya.github.io/polyhedronisme/?recipe=K300wK30t6K30gY6) | 158 | 336 | 504 |
+| [$tkG_6$](https://levskaya.github.io/polyhedronisme/?recipe=tkK300t6K30gY6) | 206 | 432 | 648 |
+| $g_T G_6$ | 24T - 10 | 48T | 72T |
-Base case 2: truncated hexagonal gyro-pyramid
:::
::::
-:::: {.column width="49%"}
-
-Conway | $F_6$ | V | E
-----------------------------------------------------------------------------------|----------|-----|-----
-[$t_5gY_5 = G_5$](https://levskaya.github.io/polyhedronisme/?recipe=K300t5K30gY5) | 10 | 40 | 60
-[$dkG_5$](https://levskaya.github.io/polyhedronisme/?recipe=dkK300t5K30gY5) | 50 | 120 | 180
-[$cG_5$](https://levskaya.github.io/polyhedronisme/?recipe=K300dudt5K30gY5) | 70 | 160 | 240
-[$wG_5$](https://levskaya.github.io/polyhedronisme/?recipe=K300wK30t5K30gY5) | 130 | 280 | 420
-[$tkG_5$](https://levskaya.github.io/polyhedronisme/?recipe=tkK300t5K30gY5) | 170 | 360 | 540
-$g_T G_5$ | 20T - 10 | 40T | 60T
-[$t_6gY_6 = G_6$](https://levskaya.github.io/polyhedronisme/?recipe=K300t6K30gY6) | 14 | 48 | 72
-[$dkG_6$](https://levskaya.github.io/polyhedronisme/?recipe=dkK300t6K30gY6) | 62 | 144 | 216
-[$cG_6$](https://levskaya.github.io/polyhedronisme/?recipe=K300dudK40t6gY6) | 86 | 192 | 288
-[$wG_6$](https://levskaya.github.io/polyhedronisme/?recipe=K300wK30t6K30gY6) | 158 | 336 | 504
-[$tkG_6$](https://levskaya.github.io/polyhedronisme/?recipe=tkK300t6K30gY6) | 206 | 432 | 648
-$g_T G_6$ | 24T - 10 | 48T | 72T
-
-::::
-:::::
-
-The pentagonal case demonstrates something interesting: an appeal to the equation $12 = 10 + 2 = 5 \cdot 2 + 2$. The similar equation $12 = 7 + 5$ is unlikely to bear fruit, as an odd number of pentagons cannot alternate up and down.
+The pentagonal case demonstrates something interesting: an appeal to the partition
+ $12 = 10 + 1 + 1$.
+The similar partition $12 = 5 + 5 + 1 + 1$ is unlikely to bear fruit,
+ as an odd number of pentagons cannot alternate up and down.
-Japanese Floor Tiling
----------------------
+### Japanese Floor Tiling
-*Tatami* are a Japanese traditional style of floor mat, used even today in Japan as an intuitive measure for the surface area of living spaces. A single mat has an aspect ratio of 2:1, but the complexity comes in how they are arranged. Layouts are termed "inauspicious" (不祝儀敷き, *fushūgi-jiki*) when there are points where four mats meet, while "auspicious" (祝儀敷き, *shūgi-jiki*) layouts have all mats meet in threes. For a sample of the fascination mathematicians have with these arrangements, you need only [search for "tatami" in the OEIS](http://oeis.org/search?q=tatami&language=english&go=Search) to find dozens of combinatorial sequences.
+*Tatami* are a Japanese traditional style of floor mat, used even today in Japan
+ as an intuitive measure for the surface area of living spaces.
+A single mat has an aspect ratio of 2:1, but the complexity comes in how they are arranged.
+Layouts are termed "inauspicious" (不祝儀敷き, *fushūgi-jiki*) when there are points where four mats meet,
+ while "auspicious" (祝儀敷き, *shūgi-jiki*) layouts have all mats meet in threes.
+For a sample of the fascination mathematicians have with these arrangements,
+ you need only [search for "tatami" in the OEIS](http://oeis.org/search?q=tatami&language=english&go=Search)
+ to find dozens of combinatorial sequences.
-:::: {layout-ncol="3"}
-::: {.column width="32%"}
-
+::: {layout-ncol="3"}
+
-Inauspicious 4x4 layout
+
+
+
:::
-::: {.column width="32%"}
-
+Topologically, each *tatami* mat in an arrangement can be thought of as either a quadrilateral,
+ a pentagon or a hexagon.
+Obviously, when considered alone, one mat is a rectangle, as is each mat in the inauspicious layout above.
+When two mats are affixed to one side of the mat, it becomes a pentagon,
+ as in the auspicious layout above; all 8 mats are pentagons.
+When done to both sides, it becomes a hexagon.
-Auspicious 4x4 layout
+Naturally, the interplay between the latter two elements, as well as the condition
+ that all mats meet in threes has a direct application to the problem at hand.
+In fact, the graph of the whirl operation on the surface of a cube
+ clearly makes the shape of one of these arrangements (with a half-mat included):
+
+:::: {#fig-tatami-polyhedron}
+::: {layout="[[-2,1,-1,1,-2]]"}
+
+
+
:::
-::: {.column width="32%"}
-
-
-Possible topologies for a single mat
-:::
-::::
-
-Topologically, each *tatami* mat in an arrangement can be thought of as either a quadrilateral, a pentagon or a hexagon. Obviously when considered alone, one mat is a rectangle, as is each mat in a stack of them like in the inauspicious layout above. When two mats are affixed to one side of the mat, it becomes a pentagon, as in the auspicious layout above; all 8 mats are pentagons. Finally, when done to both sides, it becomes a hexagon.
-
-::::: {layout-ncol="2"}
-:::: {.column width="49%"}
-