Next Article in Journal
Kirchhoff Index and Additive Kirchhoff Index Based on Multiplicative Degree for a Random Polyomino Chain
Previous Article in Journal
Fixed-Point Results for (α-ψ)-Fuzzy Contractive Mappings on Fuzzy Double-Controlled Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Near-Miss Symmetric Polyhedral Cages

by
Bernard M. A. G. Piette
* and
Árpad Lukács
Department of Mathematical Sciences, Durham University, Durham DH1 3LE, UK
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(3), 717; https://doi.org/10.3390/sym15030717
Submission received: 9 February 2023 / Revised: 2 March 2023 / Accepted: 9 March 2023 / Published: 13 March 2023
(This article belongs to the Section Mathematics)

Abstract

:
Following the experimental discovery of several nearly symmetric protein cages, we define the concept of homogeneous symmetric congruent equivalent near-miss polyhedral cages made out of P-gons. We use group theory to parameterize the possible configurations and we minimize the irregularity of the P-gons numerically to construct all such polyhedral cages for P = 6 to P = 20 with deformation of up to 10%.

1. Introduction

Recently, an artificial protein structure, referred to as TRAP-cage, was engineered from TRAP [1,2,3,4]. (TRAP is an acronym for “trp RNA-binding” attenuation protein. It is an 11 subunit RNA-binding protein that regulates expression of genes involved in tryptophan metabolism (trp) in Bacillus subtilis.)
The structure was made out of 24 nearly regular hendecagons (11 edge polygon) each having 5 neighbors with which to share an edge. The remaining 6 edges per face define the boundary of 38 holes; 32 of them are triangles, 3 faces contributing 1 edge each, while the remaining 6 are in between 4 hendecagons, each contributing 2 of their edges to them. More recently, similar nearly regular structures made out of the same protein were identified [5,6].
The geometrical structure modeling the cage proteins described above is called a polyhedral cage, or p-cage for short [7]. A p-cage corresponding to the TRAP-cage with regular polyhedra is mathematically impossible; it can only be realized approximately, if the edge lengths and angles of the polygonal faces are slightly deformed. Such an object will be called a near-miss p-cage.
Engineering polyhedral nano-structures is not new and not restricted to proteins. For example, experimental techniques called DNA origami have been created by bio-engineers [8,9,10]. Such DNA structures differ mostly from protein cages in that they are mostly hollow as the DNA strands span the edges of the polyhedra that are created. Nevertheless, the regular or nearly-regular geometries we identify in our paper could be useful for a range of nano-structures including DNA origami.
The concept of chemical cage is also not new and they are observed or made in a number of contexts [11,12,13,14,15]. Polyhedral structures in chemistry are also common [11,16,17,18].
In the present paper, we apply graph theory to describe the connectivity of p-cages, at a level where whole molecules forming the faces of the cage can be modeled with planar polygons. We note that graph theory also plays an important role at the atomic level, in molecules [19,20,21,22,23,24,25,26,27] and also in nano-structures [28,29,30,31,32,33,34,35].
The aim of this paper is to identify these new geometries as new mathematical objects, but we also aim to help bio-nano engineers to identify the type of protein assemblies likely to form nano cages, such as the ones identified in [1,2,3,4].
A first study of p-cages was recently performed [7] by creating p-cages where all the faces are equivalent from a connectivity point of view. This resulted in a large number of p-cages with a deformation below 10% and most of them, though not all, appeared to have faces with identical deformations. This suggests that one should consider p-cages where the faces are all equivalent modulo a congruent automorphism. The aim of this paper is to build such p-cages. In [7] it was shown that the connectivity between the faces of all equivalent p-cages can be constructed from the planar graphs of regular solids. All such p-cages were then constructed using polygonal faces ranging from hexagons up to polygons with 17 edges.
In this paper we build homogeneous symmetric congruent equivalent near-miss p-cages with deformation up to 10%, but unlike in [7] we impose a symmetry on the p-cages to ensure congruence between the faces. Aside from obtaining p-cages which are, in some sense, more symmetric, imposing the symmetry leads to a more efficient method to build the p-cages as there are fewer variables to adjust to optimise the p-cage near-symmetry. As the number of variables is much smaller than in the case of [7] we are able to consider all p-cages made out of faces ranging from hexagons up to polygons with 20 edges.
The paper is organised as follows. We start with a few formal definitions and then recall how the planar graphs of the regular solids are linked to the connectivity between the faces of equivalent p-cages. For each regular solid, we identify all the transitive subgroups of their symmetry group which we then use to determine which hole shapes are compatible with the equivalence of the faces.
For each regular solid, we use their symmetry group to derive a parametrization of the face vertices compatible with the equivalence and we use computer programs to identify the least deformed p-cages for each possible configuration. We finish by describing the obtained p-cages and presenting the images of some of the least deformed ones.

2. Symmetric Polyhedral Cages

Following [7] we define a polyhedral cage as an assembly of planar polygons, referred to as faces, separated by holes which are not required to be either planar or regular (see Figure 1). The edges of the polygonal faces are adjacent to either another face or a hole and will be referred to in what follows as shared-edges and hole-edges, respectively. In other words, every edge must either belong to two faces or belong to a single face as well as a hole. For any two adjacent edges at least one of them must be adjacent to a hole. Each face must also have at least three neighbors implying that the p-cage faces must have a minimum of six edges.
A homogeneous p-cage is one where all the faces are polygons with the same number of edges. As we shall only consider homogeneous p-cages in this paper, this qualifier will be omitted from now on.
A symmetric p-cage is defined as one for which for each pair of faces there is a congruent automorphism (a proper rotation) of the p-cage that maps one face onto the other. This implies that all the faces are identical.
The hull of a p-cage is defined as the polyhedron formed by the intersection of all the planes containing the faces [7]. A p-cage is said to be convex if its hull is convex. In what follows we will only consider convex p-cages.
The p-cages studied in [7] differ in that the faces are related by non congruent automorphisms, the equivalence between faces being only at the graph level or, in other words, the symmetry is at the connectivity level only and the faces can be different.
If the faces of the symmetric p-cages are regular polygons, the p-cage is said to be regular, but if the faces are not regular, the p-cage is described as near-miss. The deformation of near-miss p-cages can be so small that it is not noticeable to the naked eye, but it can also be very large. We shall define a measure of the amount of deformation below and restrict ourselves to deformations below 10%.
In what follows, we shall use N to denote the number of faces of the p-cage and P to denote the number of edges of the faces. Each hole will be made out of Q h edges where we include a hole index h as a p-cage can have different types of holes.

3. Symmetric P-Cage Construction

As described in [7], if one joins the center of the face of the p-cage that shares one edge, one obtains a polyhedron, the face of which is not necessarily planar, but the resulting graph is a planar graph  [36] (see Figure 1). We call it the hole-polyhedron because, by construction, its faces correspond to the holes of the p-cage. The vertices correspond to the faces of the p-cage and the edges to the links between the p-cage faces. This is effectively the dual of the p-cage and it encapsulates its connectivity.
Equivalence between the face of the p-cage is translated onto the hole-polyhedron as an equivalence between the vertices. Graphs for which all the vertices are equivalent are called Cayley graphs [37] and Maschke proved  [38] that the only planar Cayley graphs are the graphs of the regular solids, i.e., the prism, antiprism, Platonic solids, and Archimedean solids. To construct a cage, one must choose P, the number of edges of a polygon as well as one of the Cayley graphs. A polygon is then placed on each vertex of the graph and linked to the adjacent faces according to the edges of the graph. One then has some flexibility to distribute the hole-edges in different ways between the corners around each vertex. For example, if one places an octagon on a trivalent vertex, such as on a tetrahedron (Figure 2), there are three shared edges and five hole-edges which must be distributed between the three adjacent faces of the Cayley graph. This can be done as 1,1,3 or 1,2,2, plus permutations, but this must also be done for each face of the p-cage so that the faces of the p-cage are all equivalent.
Formally, given a Cayley graph where each vertex has d neighbors and P-gonal faces, the numbers, q i ( i = 1 d ), of hole-edges on each corner around a vertex must satisfy i = 1 d q i = P d . Equivalence between the faces of the p-cage, which translates into equivalence between the vertices of the hole-polyhedron graph, implies that the sequence q i must be identical for all vertices up to a cyclic rotation which is also determined by the equivalence. As we shall see, for some p-cages, the invariance imposes that some pairs of q i must be identical. Also, like in [7], we do not consider p-cages with q i > P / 2 , as such p-cages would not look like closed structures.
Before we proceed with the construction, it is useful to describe how we label the p-cages.

3.1. P-Cage Labeling

To label the p-cages, we follow the same notation as in [7] with a couple of differences. Each label is made of three parts: ‘ S Y M _ P p _ q i ’ where ‘SYM’ is a label identifying the hole-polyhedron from which the p-cage is built as shown in Table 1. ‘p’ is the number of edges for the p-cage faces and ‘ q i ’ the values for the labels a, b, c, d, and e shown on Figure 3, Figure 4 and Figure 5. As an example, Pte_P9_2_1_3 is the p-cage made out of nonagons built from the tetrahedron with a = 2, b = 1, and c = 3. Notice that as in [7] we have excluded the truncated cuboctahedron and the truncated icosidodecahedron because the equivalence between vertices requires a reflection which we do now allow here.
The difference compared to [7] is that we have decided to use the label sp instead of Pcu for the cube. Moreover, the p-cages labeled Poc1 in  [7] are identical to the triangular antiprism and we have kept the symbol Poc2 for the octahedron specific p-cages to avoid confusion.

3.2. Nonequivalent Hole-Edge Distribution

The distribution of hole-edges on the hole-polyhedron was done graphically in [7] for each regular solid but it can also be done using group theory. We consider one vertex of the Cayley graphs and label each face corner around a vertex with a q i . We then consider each transitive subgroup of the symmetry group of the Cayley graph, as a permutation group of the vertices, and we apply these subgroups to map the initial vertex, together with the labels q i , onto all the other vertices. If a q i is mapped onto a q j for i j , then it implies that q i = q j . Such label clashes impose some constraints on the values of the q i . We then obtain one mapping of the hole-edges for each transitive subgroup. The detailed construction is described in the Supplementary Materials and the result is summarized in the Figure 3, Figure 4 and Figure 5 where, for compatibility with [7], the q i have been labeled a, b, c, d, e.
Because the planar graphs we are considering are those of regular solids, their symmetry groups are well known and fall into two classes [36,39,40]:
  • The dihedral groups D n generated by a rotation with an angle 2 π / n around an axis, and one by an angle π around an axis orthogonal to the first one. This is the full symmetry of the prism and antiprism.
  • The tetrahedral, octahedral, and icosahedral symmetry groups, of the Platonic and Archimedean polyhedra.
A brute force method for finding subgroups of finite groups, while in principle a finite algorithm, is too slow for practical purposes. Luckily, faster algorithms and tables for maximal subgroups are known, and have been implemented in the computer algebra software GAP; see [41] (and references therein). In what follows, we use the lists of subgroups obtained using GAP. For the tetrahedron, we have also obtained the list of subgroups by listing them in the order of their number of elements, taking into account that this must be a divisor of the order of the full group [39,40]. The process is sped up by finding first the Sylow-subgroups [39]. Alternatively, information on subgroups of finite groups is contained in [42]. As stated above, we did not consider the truncated cuboctahedron and the truncated icosidodecahedron because their symmetry group is not transitive.
The results are summarized in Table 2 and Table 3. More details are provided in the Supplementary Materials.
From Table 2, we see that the prisms, the anti-prisms, the tetrahedron, the cube, and the icosahedron have one transitive subgroup which does not lead to any constraints on the labeling of the hole-edges. This implies that there is a single labeling without constraints between the q i , as illustrated in Figure 3 and Figure 4. The octahedron, which is a triangular anti-prism, has two transitive subgroups. The first one is S 3 = D 3 , which can be applied in four different ways and which is the symmetry of the triangular anti-prism as expected. The second transitive subgroup is specific to the extra symmetry of the octahedron and it imposes the constraint q 1 = q 3 and q 2 = q 4 as illustrated in Figure 4 (where c = a and d = b ). The dodecahedron does not have any transitive subgroups and the full group symmetry imposes that the q i are all identical.
From Table 3, we see that the only Archimedean solid which has a transitive subgroup is the cuboctahedron but it does not lead to any constraints between the q i . The other solids do not have any transitive subgroups and their symmetries do not induce constraints between the q i except for the icosidodecahedron where q 1 = q 3 and q 2 = q 4 .
Now that we have derived all the possible connectivities between the faces of the p-cages we can construct p-cages and minimize their deformation.

4. Near-Miss Convex Symmetric P-Cages

For a p-cage to be regular, all the faces, all the edges, and all the angles of the polygonal faces must be identical. For a P-gon, this means that all the edges must have the same length L and the same angle π ( 1 2 / P ) . Near-miss p-cages are p-cages where the faces are not regular polygons, but close to being regular. Irregular faces will have edge lengths and angles slightly different from the values of a regular one.
To evaluate the level of regularity of the p-cage we first determine the distance d i between vertices i and i + 1 as well as the angle α i between the segments ( i 1 , i ) and ( i , i + 1 ) . The function we must minimize is then:
E = 1 P i c l d i L L 2 + c a α i π ( 1 2 P ) π ( 1 2 P ) 2 + c c E conv
where c l , c a , and c c are three weight factors. E conv , given explicitly by (3), is 0 unless the polygon defined by the n i is concave. It is used in the simulated annealing to enforce convexity of the faces by taking a large value of c c . We divide the sum by P to approximately set the same energy scale for each P. This makes the parametrization of the optimizing algorithm easier.
To characterize the face, with normal vector m f , we define n i as its vertices, ordered anticlockwise. Then, to measure the angle α i and edge length d i , we define v i = n i n i 1 , evaluate v i × v i + 1 and
if   ( v i × v i + 1 ) · m f 0 : α i = π acos ( ( v i · v i + 1 ) | v i | | v i + 1 | ) , d i = | v i | if   ( v i × v i + 1 ) · m f < 0 : α i = π + acos ( ( v i · v i + 1 ) | v i | | v i + 1 | ) , d i = | v i | .
Note that α i in (2) corresponds to the angle inside the face which is larger than π if the face is not convex. If m f is the vector normal to the face and if the n i are running anticlockwise when seeing the face in the direction of n f , then, using the Heaviside function H ( x ) :
E conv = 1 P i H ( v i × v i + 1 ) · m f .
We then define the length and angle deformations as follows:
  • Length: Δ l = max i ( | d i L L | )
  • Angle: Δ a = max i ( | α i π ( 1 2 P ) π ( 1 2 P ) |
In most cases near-miss p-cages can be deformed smoothly, changing the edge lengths as well as the angles and as a result both Δ l and Δ a . Identifying near-miss p-cages for a given connectivity (fixed hole-polyhedra, P and q i ) consists in finding the geometry which minimizes Δ l and Δ a . This can be done by minimizing the function (1) over the coordinates of the vertices. As in [7], we do this using a simulated annealing algorithm, for a range of values of c l and c a satisfying the constraint c l + c a = 2 . After removing from the obtained p-cages those with crossing faces, we have selected the configuration with the smallest deformation, i.e., those for which the maximum value of Δ l and Δ a is the smallest.
The regular convex p-cages ( Δ l = Δ a = 0 ) were derived analytically in [7].

5. Optimization of the P-Cage Coordinates

To build the symmetric p-cage, we consider one face, which we refer to as the reference face, as well as the plane that it spans. The normal vector to that plane can have a range of orientations, and we apply the symmetry of the underlying solid to that plane to generate the planes spanned by the adjacent faces. We then determine the lines of intersection between these neighbor faces and place the shared vertices onto these lines. Notice that as the p-cage faces have holes, the actual symmetry of the p-cages allows for some additional deformation as will be described below. The vertices which are not shared can then be placed on the reference face plane. One can then determine the most general analytic expression for the coordinates of the vertices of the reference face for each of the hole-polyhedra graphs. These expressions depends on a number of parameters which can then be optimized to obtain the p-cage minimizing the deformation energy (1). We did this for 200 values of the weight parameters c l and c a such that they satisfy the constraint c l + c a = 2 . Once the coordinates of the reference face have been obtained, one can obtain the coordinates of the full p-cage vertices by applying the symmetry group of the p-cage.
One of the problems we will have to solve is to find the intersection between two planes defined by:
P 1 ( t 1 , t 2 ) = V + t 1 v 1 + t 2 v 2 , P 2 ( s 1 , s 2 ) = W + s 1 w 1 + s 2 w 2 ,
where the t 1 , t 2 , s 1 , s 2 are parameters, V and W are arbitrary vectors, and where the plane basis vectors v 1 and v 2 can be assumed to be orthonormal, and similarly for w 1 and w 2 .
First we define the normal vectors, p and q , to the planes as well as the vector u parallel to the plane intersection:
p = v 1 × v 2 , q = w 1 × w 2 , u = q × p .
Next, we have to find a specific point on the intersecting line and we choose the one that is perpendicular to u :
U = V + t 1 v 1 + t 2 v 2 = W + s 1 w 1 + s 2 w 2
and multiplying (6) by u leads to a relation between t 1 and t 2 as well as s 1 and s 2 . Then multiplying (6) by q one obtains an expression for t 1 which when inserted back into (6) gives:
U = V + ( q · ( W V ) ) ( u · v 2 ) + ( u · V ) ( q · v 2 ) ( q · v 1 ) ( u · v 2 ) ( u · v 1 ) ( q · v 2 ) v 1 ( u · v 1 ) ( u · v 2 ) v 2 ( u · V ) ( u · v 2 ) v 2 .
We are now ready to construct each family of p-cages one by one by considering their specific symmetries.

5.1. P-Cages

We now consider each generating regular solid in turn and generate the planes making the p-cage using the specific symmetry of the solid and determine the line of intersection where the shared segment lies. Note that the length of V in (4) is arbitrary as it will be adjusted to set the scale of the p-cage so that the edge lengths are as close as possible to the target length (chosen arbitrarily to be 1). For many p-cages, there will also be one or two angles corresponding to deformations of the dual of the generating regular solid.
Some of the coordinates of the vertices on the shared segments will be of the form:
n i = U + t i u
where U and u are specific to each segments. The remaining shared vertices will be of the form:
n i = R n j
where R is a rotation symmetry. The details will vary according to the generating regular solid.
The coordinates of the vertices which are not part of a shared edge will be of the form:
α i = V + t α i v 1 + s α i v 2 , i = 1 q α 1
where q α stands for a, b, c, d, or e, as appropriate. Once this is done, the actual position of the vertices will be determined by minimizing (1), the optimizing variables being the length of V , some angles describing the relative orientation between some of the faces as well as the position of all the vertices on the face plane.

5.2. Tent

We shall see that a common substructure of the dual of the generating regular solid is a pyramid. When the faces of the p-cage are placed on a pyramid, they each have three shared segments, two with the adjacent faces of the pyramid and one at the base. We call such a structure a tent. The shared segment at the base does not need to be centered and, as we shall see, does not need to be parallel to the base either. This is because two adjacent pyramids can sometimes be rotated around their main symmetry axis. As we shall see, for the Archimedean based p-cages, the tents will not have a common symmetry axis.
The origin of the coordinate system for the reference face is chosen as the center of the base of the pyramid (Figure 6). The x axis runs parallel to the edge of the base of the pyramid while the y axis is parallel to the pyramid base and perpendicular to the x axis. The inclination angle of the pyramid face is θ .
The edges joining n 1 and n 2 as well as n 3 and n 4 on Figure 6 are shared edges. So is the edge joining n 5 and n 6 . The vertices that are not shared must also belong to the plane of the face.
If the base of the pyramid is an N-gon, n 1 and n 4 are related by a 2 π / N rotation around the vertical symmetry axis, z , of the pyramid. So are n 2 and n 3 . n 5 and n 6 will be related to each other by a rotation which depends on how adjacent tents are placed with respect to each other.
In what follows, we shall use the notation R v ( θ ) to denote a θ rotation around the vector v . We also use T v to denote a reflection with respect to the v axis. If v is x , y , or z it then corresponds to a rotation, or a reflection, around the corresponding axis.

5.3. Specific Cases

In what follows, r f and r o refer respectively to the inner and outer radius of the face of a regular solid, while r i refers to the inner radius of the regular solid (the radius of the smallest sphere containing it).

Prism P-Cages

The dual of a prism consists of two identical pyramids joined at their base. The faces of the pyramids can have any angle with the base. For a pyramid with an N-gon base, the symmetries are rotations of γ = 2 π / N around the main axis z of the pyramid. (See Figure 6). To map the two pyramids into each other we must perform a π rotation around the y axis joining the center of the base and the center of one of the base edge. Alternatively we can perform a π rotation around the z axis followed by a π rotation around the x  axis.
Because the faces of a p-cage do not cover the full face of the pyramid, we can also rotate the pyramids around the z axis by an angle ψ . So to map the two tents together, we must perform a π + ψ rotation around the z axis followed by a π rotation around the x axis.
To describe the plane of the reference face we define:
V = S 0 , sin ( θ ) , cos ( θ ) , v 1 = ( [ 1 , 0 , 0 ] ) , v 2 = V × v 1 | V × v 1 | ,
where S is a scaling parameter. As a result, the adjacent face belonging to the same pyramid is given by:
W = R z ( 2 π N ) V , w 1 = R z ( 2 π N ) v 1 , w 2 = R z ( 2 π N ) v 2
and using the corresponding U and u , (7):
n 1 = U t 1 u , n 2 = U + t 2 u , n 3 = R z ( 2 π N ) n 2 , n 4 = R z ( 2 π N ) n 1 .
For the vertices at the base of the tent:
W = R x ( π ) R z ( π + ψ ) V , w 1 = R x ( π ) R z ( π + ψ ) v 1 , w 2 = R x ( π ) R z ( π + ψ ) v 2
and using the corresponding U and u :
n 5 = U t 5 u , n 6 = R x ( π ) R z n 5 .
The optimizing variables are S, θ , ψ , t 1 , t 2 , t 5 , Equations (11), (13), (14), and (15), as well as the coordinates, in the face plane, of the non shared vertices.

5.4. Regular Flat Prisms P-Cages

A degenerate case of p-cages corresponds to flat p-cages, i.e., θ = 0 . This implies that the n 1 n 2 and n 3 n 4 lines intersect each other at the center of the prism base. The angle between these two lines is π 2 ( q a + 1 ) π / P and this must equal 2 π / N . In other words, for a given polygon P and prism base N:
q a = ( N 2 ) P 2 N 1 .
The list of regular flat prisms is given in Table 4.

6. Antiprisms

The dual of an antiprism can be seen as two pyramids joined at the base and rotated by an angle π / N relative to each other, resulting in each face having four neighbors: two on the sides and two at the base.
The parametrization is similar to that of the prism p-cage and the vertices n 1 to n 4 are also given by (13).
For the first pair of shared vertices at the base:
R = R x ( π ) R z ( π ( 1 + 1 N ) + ψ ) , W = R V , w 1 = R v 1 , w 2 = R v 2
and using the corresponding U and u :
n 5 = U t 5 u , n 6 = R x ( π ) R z n 5 .
For the second pair of shared vertices:
R = R x ( π ) R z ( π ( 1 1 N ) + ψ ) , W = R V , w 1 = R v 1 , w 2 = R v 2
and using the corresponding U and u :
n 7 = U t 7 u , n 8 = R x ( π ) R z n 7 .
The optimizing variables are S, θ , ψ , t 1 , t 2 , t 5 , t 7 , Equations (11), (13), (17), (18), and (20), as well as the coordinates, in the face plane, of the non shared vertices.

7. Platonic Solids

7.1. Tetrahedron

The generating regular solid of the tetrahedron p-cage is a tetrahedron. As a result, the face of the p-cage must be placed on the faces of the dual tetrahedron but it does not need to be regular and can be elongated in such a way that the line joining the center of two pairs of opposite edges is stretched.
The coordinates of the four vertices of the tetrahedron (Figure 7) are:
e 1 = 1 , 1 , a , e 4 = 1 , 1 , a , e 3 = 1 , 1 , a , e 4 = 1 , 1 , a .
where a is a stretching parameter. We choose the first face as spanned by e 1 , e 2 , e 3 and the center of that face is V 0 = ( e 1 + e 2 + e 3 ) / 3 . We then take:
v 1 = 1 2 , 1 2 , 0 , v 2 = e 3 ( e 1 + e 2 ) / 2 .
Noticing that V is not orthogonal to v 2 , we must take as the displacement vector for the face plane:
V = S ( v 1 × v 1 ) ( ( v 1 × v 1 ) · V 0 ) ,
where S is a scaling parameter. Defining:
R 1 = R v 1 ( π ) R z ( π / 2 ) , R 2 = R v 1 ( π ) R z ( π / 2 ) , R 3 = R z ( π )
the vector describing the adjacent faces are:
W i = R i V , w 1 i = R i v 1 , w 2 i = R i v 2
and the corresponding U i and u i :
n 2 i 1 = U i + t 2 i 1 u i , n 2 i = R i 1 n 2 i 1 , i = 1 , 2 , 3 .
The optimizing variables are S, a, t 1 , t 3 , t 5 , Equations (21), (23), and (26), as well as the coordinates, in the face plane, of the non shared vertices.

7.2. Octahedron

The dual of the octahedron is the cube, so the face of the octahedron derived p-cages will be inscribed on the faces of a cube.
The cube can be stretched in one direction so that two of the faces remain square but the other four become identical rectangles, the symmetry is that of a square antiprism, referred to as Poc1 in [7].
When the cube is not stretched, the symmetry is larger and the shared vertices ab are facing shared vertices ba. This is referred to as Poc2, as in [7].
There are two ways to map the vertices on the face of the cube. The first possibility is to pinch the cube, making the faces diamond shape, but for the edges to meet correctly they must be centered on the edges of the diamond. This is nothing but the triangular antiprism with a = c and b = d .
In the second one, the squares are not deformed and the shared edges are not centered on the edges of the squares. To preserve the symmetry of the hole distribution, the cube must remain undeformed. To describe the plane of the reference face we define:
V = ( 0 , 0 , S ) v 1 = ( 1 , 0 , 0 ) , v 2 = ( 0 , 1 , 0 )
and the symmetries are ± π / 2 rotations around the x and the y axis:
R 1 = R y ( π / 2 ) , R 2 = R x ( π / 2 ) .
Next, the adjacent faces are described by the vectors:
W i = R i V , w 1 i = R i v 1 , w 2 i = R i v 2 , i = 1 , 2
together with the corresponding U i and u i .
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = U 2 t 2 u 2 , n 4 = U 2 t 1 u 2 , n 4 + i = R z ( π ) n i , i = 1 , 4 .
The optimizing variables are S, t 1 , t 2 , Equations (27) and (30), as well as the coordinates, in the face plane, of the non shared vertices.

7.3. Cube

The p-cages derived from the cube are the same as those derived from the square prism.

7.4. Dodecahedron

The p-cages derived from the dodecahedron must have identical holes, so the symmetry is very constrained. The faces must be placed on an icosahedron.
As the inner radius of an icosahedron of edge length 1 is r i = ϕ g 2 / 12 where ϕ g = ( 1 + 5 ) / 2 , and with r o = 1 / ( 2 sin ( 2 π / 3 ) we take:
V = r i ( 0 , 0 , S ) v 1 = ( 1 , 0 , 0 ) , v 2 = ( 0 , 1 , 0 ) .
where S is a scaling factor. We place the three vertices at:
f 1 = V + ( 0 , S r o , 0 ) , f i + 1 = R z ( i 2 π 3 ) f 1 i = 1 , 2 .
The midpoint between the first and last vertex is:
a = f 1 + f 3 2
and the adjacent faces are described by the vectors:
W = R f 1 ( 2 π 5 ) V , w 1 = R f 1 ( 2 π 5 ) v 1 , w 2 = R f 1 ( 2 π 5 ) v 2 .
and the line intersecting the reference face is described by the corresponding U and u . From this we obtain:
n 1 = U + t u , n 2 = R a ( π ) , n 1 , n 2 i + 1 = R z ( 2 π i 3 ) , n 1 , n 2 i + 2 = R z ( 2 π i 3 ) , n 2 , i = 1 , 2 .
The optimizing variables are S, t, Equations (31) and (35), as well as the coordinates, in the face plane, of the non shared vertices.

7.5. Icosahedron

The p-cages derived from the icosahedron consist in placing the faces on a dodecahedron. As the inner radius of a dodecahedron of edge length 1 is r i = ϕ g 2 / ( 2 3 ϕ g ) , and r o = 1 / ( 2 sin ( π / 5 ) ) , we take:
V = r i ( 0 , 0 , S ) , v 1 = ( 1 , 0 , 0 ) , v 2 = ( 0 , 1 , 0 ) .
where S is a scaling factor. We place the five vertices of the dodecahedron at:
f 1 = V + ( 0 , S r o , 0 ) , f i + 1 = R z ( i 2 π 5 ) f 1 , i = 1 , 2 , 3 , 4 .
Next, the adjacent faces are described by the vectors:
W i = R f i ( 2 π 3 ) V , w 1 i = R f i ( 2 π 3 ) v 1 , w 2 i = R f i ( 2 π 3 ) v 2 , i = 1 , . . , 5 .
together with the corresponding U i and u i . Defining T x as a reflection around the x axis, (Figure 8):
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = T x n 2 , n 4 = T x n 1 , n 5 = U 3 + t 5 u 3 , n 6 = U 3 + t 6 u 1 , n 7 = R z ( 4 π 2 ) T x R z t ( 4 π 2 ) n 2 , n 8 = R z ( 4 π 2 ) T x R z t ( 4 π 2 ) n 1 , n 9 = U 5 + t 9 u 5 , n 10 = R ( f 4 + f 5 ) ( π ) n 9 .
The optimizing variables are S, t 1 , t 2 , t 5 , t 6 , t 9 , Equations (36) and (39), as well as the coordinates, in the face plane, of the non shared vertices.

8. Archimedean Solids

8.1. Truncated Platonic Solids

The p-cages generated from a truncated Platonic solid can be obtained by placing a tent on the faces of the dual solid, referred to as the underlying solid. For example, p-cages are obtained from the truncated cube by placing a triangular tent on the faces of an octahedron (Figure 9).
  • Truncated tetrahedron: triangular tent on the faces of a tetrahedron.
  • Truncated cube: triangular tent on the faces of an octahedron.
  • Truncated octahedron: square tent on the faces of a cube.
  • Truncated dodecahedron: triangular tent on the faces of a icosahedron.
  • Truncated icosahedron: pentagonal tent on the faces of a dodecahedron.
The side vertices, n 1 n 4 are obtained exactly like for the prism (Figure 6). The bottom vertices, n 5 and n 6 are obtained by finding the intersection between the plane of the first face and the plane obtained by a π rotation of that face around the vector V 0 = ( r f sin ( ψ ) , r f cos ( ψ ) , r i ) where r f and r i are properties, listed in Table 5, of the Platonic solid on which the p-cage faces are placed.
The vertices n 5 and n 6 are then placed symmetrically around the point of intersection between the line span by V 0 and the intersection between the planes of the two faces.
The normal to the faces is V given by (11) and for the cage to be convex the angle between V and the normal to the Platonic solid face on which the tent is built, θ = arccos ( ( V · e ^ x ) ) , must be smaller than π ϕ d where ϕ d is the dihedral angle of the underlying Platonic solid.

8.2. Cuboctahedron

The dual of the cuboctahedron is a rhombic dodecahedron which is made out of twelve identical rhombi. This can also be thought of as four triangular pyramids placed on the faces of a tetrahedron. The faces of the pyramids are located near the corner of the triangles so as to be adjacent to two faces of two other pyramids. This can be done in two different ways, around the triple ‘a’ vertex or around the the triple ‘c’ one. In both cases, the quadrivalent holes are mapped on the edges of the tetrahedron (Figure 10).
We take the following coordinates for the tetrahedron,
f 1 = ( 1 / 2 , 1 / 2 3 , 1 / 2 6 ) , f 2 = ( 1 / 2 , 1 / 2 3 , 1 / 2 6 ) , f 3 = ( 0 , 1 / 3 , 1 / 2 6 ) , and f 4 = ( 0 , 0 , 3 / 8 ) , which correspond to an upside down pyramid.
We choose the following vectors:
V = S 0 , sin ( θ ) , cos ( θ ) , v 1 = ( 1 , 0 , 0 ) , v 2 = V × v 1 | V × v 1 | ,
where S is a scaling parameter, to describe the plane of the reference face. The adjacent face belonging to the same pyramid is then given by:
W 1 = R z ( 2 π 3 ) V , w 1 1 = R z ( 2 π 3 ) v 1 , w 2 1 = R z ( 2 π 3 ) v 2
and using the corresponding U and u :
n 1 1 = U + t 1 u , n 2 = U + t 2 u , n 3 1 = R z ( 2 π 3 ) n 2 n 4 1 = R z ( 2 π 3 ) n 1 .
For the remaining four vertices, we must consider the axis f 3 as an axis of symmetry which can also be rotated by an angle ψ around the z axis: g 3 = R z ( ψ ) f 3 . Then the adjacent face containing n 7 and n 8 is spanned by the vectors:
W 2 = R g 3 ( 2 π 3 ) V , w 1 2 = R g 3 ( 2 π 3 ) v 1 , w 2 2 = R g 3 ( 2 π 3 ) v 2
and using the corresponding U and u :
n 7 2 = U + t 7 u n 8 = U + t 8 u n 5 2 = R g 3 ( 2 π 3 ) n 8 n 6 2 = R g 3 ( 2 π 3 ) n 7 .
The optimizing variables are S, t 1 , t 2 , t 7 , and t 8 , Equations (40), (42), and (44), as well as the coordinates, in the face plane, of the non shared vertices.
The rhombic dodecahedron has twelve quadrilateral faces. These faces have two vertices with three neighbors and two with four. One can split the quadrivalent vertices in two by inserting an extra edge and do so to obtain the graph of the dodecahedron. This means that the regular p-cages obtained by tiling the faces of the dodecahedron such that the added edge matches a shared edge of the p-cage face corresponds to a degenerate symmetric p-cage derived from the cubocatehedron. More explicitly, Aco_P10_1_1_1_3, Aco_P15_2_2_2_5, and Aco_P20_3_3_3_7 are degenerate cases of Pic_P10_1_1_1_1_1,
Pic_P15_2_2_2_2_2, and Pic_P20_3_3_3_3_3, respectively.

8.3. Icosidodecahedron

The dual of the icosidodecahedron is a rhombic tricontahedron which is made out of 30 identical rhombi. The p-cage is obtained by inscribing a P-gon inside that rhombus face (Figure 11).
The line n 1 n 2 is obtained by determining the intersection of the plane containing the master face and the one obtained after a 2 π / 3 rotation about the axis f 1 . Then, n 3 and n 4 are obtained by performing a reflection around the f 1 f 3 axis of n 2 and n 1 , respectively. The vertices n 5 , n 6 , n 7 , and n 8 are obtained by performing a reflection around the f 2 f 4 axis of n 4 , n 3 , n 2 , and n 1 , respectively.
The coordinates of the rhombic tricontahedron are given by:
± ϕ g 2 , ± ϕ g 2 , ± ϕ g 2 8 vertices
± ϕ g 3 , ± ϕ g , 0 + cycl . : 12 vertices
± ϕ g 2 , ± ϕ g 3 , 0 + cycl . : 12 vertices
The first 20 vertices are trivalent while the last 12 are pentavalent.
Up to a scaling factor, we can take f 1 = ( ϕ g 2 , 0 , ϕ d 3 ) , f 2 = ( 0 , ϕ g , ϕ d 3 ) , f 3 = ( ϕ g 2 , 0 , ϕ d 3 ) , and f 4 = ( 0 , ϕ g , ϕ d 3 ) . The center of the master face is then V f = ( f 1 + f 3 ) / 2 = ( 0 , 0 , ϕ g 3 ) .
We take:
V = S V f , v 1 = ( 1 , 0 , 0 ) , v 2 = ( 0 , 1 , 0 )
and
W i = R f i ( 2 π 3 ) V , w 1 i = R f i ( 2 π 3 ) v 1 , w 2 i = R f i ( 2 π 3 ) v 2 , i = 1 , 3 ,
together with the corresponding U 1 , u 1 , U 3 , and u 3 .
Then:
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = T x n 2 , n 4 = T x n 1 , n 5 = T y n 4 , n 6 = T y n 3 , n 7 = T y n 2 , n 8 = T y n 1 .
The optimizing variables are S, t 1 , t 2 , Equations (48) and (50), as well as the coordinates, in the face plane, of the non shared vertices.

8.4. Rhombicuboctahedron

The dual of the rhombicuboctahedron is the deltoidal icositetrahedron. It is made out of twenty-four kite faces. Three of the vertices of the faces are quadrivalent while the fourth one is trivalent. Up to an overall scale, they are at the following positions:
± 1 , 0 , 0 , + cycl . : 8 quadrivalent vertices
0 , ± 1 2 , ± 1 2 , + cycl . : 12 quadrivalent vertices
± 8 + 1 7 , ± 8 + 1 7 , ± 8 + 1 7 8 trivalent vertices .
The deltoidal icositetrahedron can be projected onto a cube so that each kite becomes one of four squares on the face of the cube. As a result, building the cage consists in placing a square tent on each face of a cube so that the bottom of the faces are joined with the two faces merging at the corners of the cube. The tent can be twisted.
We place the corner of the cube at the coordinates ( 0 , ± 1 , ± 1 / 2 ) and ( ± 1 , 0 , ± 1 / 2 ) and pick f 1 = ( 0 , 1 , 1 / 2 ) . We take v 1 and v 2 as the orthonormal coordinate vectors for the reference face and V as the center of the face:
v 1 = ( cos ( ψ ) , sin ( ψ ) sin ( θ ) , sin ( ψ ) cos ( θ ) ) , v 2 = ( 0 , cos ( θ ) , sin ( θ ) ) , V = S cos ( ψ ) ( sin ( θ ) + cos ( θ ) ) ( v 1 × v 2 ) .
Then:
W 1 = R f 1 ( 2 π 3 ) V , w 1 1 = R f 1 ( 2 π 3 ) v 1 , w 2 1 = R f 1 ( 2 π 3 ) v 2 W 3 = R z ( π 2 ) V , w 1 3 = R z ( π 2 ) v 1 , w 2 3 = R z ( π 2 ) v 2
together with the corresponding U 1 , u 1 , U 3 , and u 3 .
The line n 1 n 2 corresponds to the intersection of the master plane and its 2 π / 3 rotation around the f 1 axis. Then n 3 and n 4 are obtained respectively by rotating n 2 and n 1 by 2 π / 3 around the f 1 axis.
The line n 5 n 6 corresponds to the intersection of the master plane and its π / 2 rotation around the z axis. Then n 7 and n 8 are obtained by respectively rotating n 6 and n 5 by π / 2 around the z axis.
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = R f 1 ( 2 π 3 ) n 2 , n 4 = R f 1 ( 2 π 3 ) n 1 , n 5 = U 3 + t 5 u 3 , n 6 = U 3 + t 6 u 3 , n 7 = R z ( π 2 ) n 6 , n 8 = R z ( π 2 ) n 5 .
To ensure that the cage is convex, we must also impose that the triangular tents are not concave. This implies the following condition: ( n × f 1 ) · v 1 > 0 .
The optimizing variables are S, ψ , t 1 , t 2 , t 5 , t 6 , Equations (54) and (56), as well as the coordinates, in the face plane, of the non shared vertices (Figure 12).

8.5. Rhombicosidodecahedron

The dual of the rhombicosidodecahedron is the deltoidal hexecontahedron. It is made out of sixty kite faces. Three of the vertices are pentavalent while the fourth one is trivalent. The p-cage built from the rhombicosidodecahedron can be obtained by placing tents on the faces of a dodecahedron (Figure 13).
If a is the length of each edges, the inner radius of a dodecahedron is r i = a / 2 5 / 2 + 11 5 / 10 , while the outer radius of each face is r h = a / ( 2 sin ( π / 5 ) ) . Then the angle ξ d between the center of the face and one of the vertices is such that:
tan ( ξ d ) = r h r i = sin ( π 5 ) 5 2 + 11 10 5 1 .
To describe the plane of the reference face we take V = ( 0 , 0 , 1 ) and define:
f 1 = 0 , tan ( ξ d ) , 1 .
Then the orthonormal coordinate vectors for the master face v 1 , v 2 are, once again, given by (54).
V = S cos ( ψ ) ( cos ( θ ) sin ( θ ) ) tan ( ξ d ) ( v 1 × v 2 ) .
Then:
W 1 = R f 1 ( 2 π 3 ) V , w 1 1 = R f 1 ( 2 π 3 ) v 1 , w 2 1 = R f 1 ( 2 π 3 ) v 2 W 3 = R z ( 2 π 5 ) V , w 1 3 = R z ( 2 π 5 ) v 1 , w 2 3 = R z ( 2 π 5 ) v 2
together with the corresponding U 1 , u 1 , U 3 , and u 3 .
The line n 1 n 2 corresponds to the intersection of the master plane and its 2 π / 3 rotation around the f 1 axis. Then n 3 and n 4 are obtained by respectively rotating n 2 and n 1 by 2 π / 3 around the f 1 axis.
The line n 5 n 6 corresponds to the intersection of the master plane and its 2 π / 5 rotation around the z axis. Then n 7 and n 8 are obtained by respectively rotating n 6 and n 5 by 2 π / 5 around the z axis.
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = R f 1 ( 2 π 3 ) n 2 , n 4 = R f 1 ( 2 π 3 ) n 1 , n 5 = U 3 + t 5 u 3 , n 6 = U 3 + t 6 u 3 , n 7 = R z ( 2 π 5 ) n 6 , n 8 = R z ( 2 π 5 ) n 5 .
To ensure that the cage is convex, we must also impose that the triangular tents are not concave. This implies the following conditions: ( n × f 1 ) · v 1 > 0 .
The optimizing variables are S, θ , ψ , t 1 , t 2 , t 5 , t 6 , Equations (59) and (61), as well as the coordinates, in the face plane, of the non shared vertices.

8.6. Snub Cube

The dual of the snub cube is the pentagonal icositetrahedron. It is made out of twenty-four  irregular pentagons. It can be seen as six square base tents made out of irregular pentagons built around a regular cube. The main axes of these tents are the axes going through the centers of the faces of the cube. Alternatively, it can be seen as right triangular base tents, the main axes corresponding to the vertices of the cube (Figure 14).
The vertices n 3 and n 4 are related respectively to the vertices n 2 and n 1 by a 2 π / 4 rotation around f 1 , where f 1 points to the center of a face of a cube. The vertices n 7 and n 8 are related respectively to the vertices n 6 and n 5 by a 2 π / 3 rotation around f 3 where f 3 points to a vertex of a cube. If we take f 1 = ( 0 , 0 , 1 ) and f 3 = ( 1 , 1 , 1 ) then the vertices n 9 and n 10 are related to each other by a π rotation around g = ( 1 , 0 , 1 ) .
We take:
v 1 = ( 1 , 0 , 0 ) , v 2 = ( 0 , cos ( θ ) , sin ( θ ) ) , V = S cos ( θ ) ( v 1 × v 2 ) = S cos ( θ ) ( 0 , sin ( θ ) , cos ( θ ) )
We then rotate the vectors f 3 and g 1 by an angle ψ . For the pentagonal icositetrahedron θ 31 . 75   ψ 61 . 46 .
Using the vector g = ( 1 , 0 , 1 ) we define:
W 1 = R f 1 ( π 2 ) V , w 1 1 = R f 1 ( π 2 ) v 1 , w 2 1 = R f 1 ( π 2 ) v 2 W 2 = R f 3 ( 2 π 3 ) V , w 1 2 = R f 3 ( 2 π 3 ) v 1 , w 2 2 = R f 3 ( 2 π 3 ) v 2 W 3 = R g ( 2 π 3 ) V , w 1 3 = R g ( π ) v 1 , w 2 3 = R g ( π ) v 2 .
together with the corresponding U i and u i .
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = R f 1 ( π 2 ) n 2 , n 4 = R f 1 ( π 2 ) n 1 , n 5 = U 2 + t 5 u 2 , n 6 = U 2 + t 6 u 2 , n 7 = R f 3 ( 2 π 3 ) n 6 , n 8 = R f 3 ( 2 π 3 ) n 5 , n 9 = U 3 + t 9 u 3 , n 10 = U 3 t 9 u 3 .
The optimizing variables are S, θ , ψ , t 1 , t 2 , t 5 , t 6 , t 9 , Equations (62) and (64), as well as the coordinates, in the face plane, of the non shared vertices.

8.7. Snub Dodecahedron

The dual of the snub dodecahedron is the pentagonal hexecontahedron. It is made out of sixty irregular pentagons. It can be seen as twelve pentagonal base tents made out of irregular pentagons built around a regular dodecahedron. The main axes of these tents are the axes going through the centers of the faces or the dodecahedron. Alternatively it can be seen as twenty triangular base tents, the main axes corresponding to the vertices of the dodecahedron (Figure 15).
The vertices n 3 and n 4 are related respectively to the vertices n 2 and n 1 by a 2 π / 5 rotation around f 1 , where f 1 points to the center of a face of a dodecahdron. The vertices n 7 and n 8 are related respectively to the vertices n 6 and n 5 by 2 π / 3 rotation around f 3 where f 3 points to a vertex of a cube. If we take f 1 = ( 0 , 0 , 1 ) and f 3 = ( 0 , tan ( ξ d ) , 1 ) then
f ^ 3 = ( sin ( 2 π / 5 ) tan ( ξ d ) , cos ( 2 π / 5 ) tan ( ξ d ) , 1 ) where ξ d is given by (56). The vertices n 9 and n 10 are related to each other by a π rotation around g where g = ( f 3 + f ^ 3 ) / 2 = ( sin ( 2 π / 5 ) tan ( ξ d ) / 2 , ( 1 + cos ( 2 π / 5 ) ) tan ( ξ d ) / 2 , 1 ) .
We take:
v 1 = ( 1 , 0 , 0 ) , v 2 = ( 0 , cos ( θ ) , sin ( θ ) ) , V = S cos ( θ ) ( v 1 × v 2 ) = S cos ( θ ) ( 0 , sin ( θ ) , cos ( θ ) )
Next, we rotate the vectors f 3 and g 1 by an angle ψ . For the pentagonal icositetrahedron θ 31 . 75   ψ 61 . 46 .
Using the vector g = ( 1 , 0 , 1 ) we define:
W 1 = R f 1 ( 2 π 5 ) V , w 1 1 = R f 1 ( 2 π 5 ) v 1 , w 2 1 = R f 1 ( 2 π 5 ) v 2 W 2 = R f 3 ( 2 π 3 ) V , w 1 2 = R f 3 ( 2 π 3 ) v 1 , w 2 2 = R f 3 ( 2 π 3 ) v 2 W 3 = R g ( 2 π 3 ) V , w 1 3 = R g ( π ) v 1 , w 2 3 = R g ( π ) v 2 .
together with the corresponding U i and u i .
n 1 = U 1 + t 1 u 1 , n 2 = U 1 + t 2 u 1 , n 3 = R f 1 ( 2 π 5 ) n 2 , n 4 = R f 1 ( 2 π 5 ) n 1 , n 5 = U 2 + t 5 u 2 , n 6 = U 2 + t 6 u 2 , n 7 = R f 3 ( 2 π 3 ) n 6 , n 8 = R f 3 ( 2 π 3 ) n 5 , n 9 = U 3 + t 9 u 3 , n 10 = U 3 t 9 u 3 .
The optimizing variables are S, θ , ψ , t 1 , t 2 , t 5 , t 6 , t 9 , Equations (65) and (67), as well as the coordinates, in the face plane, of the non shared vertices.

9. Results

We have found 2371 symmetric p-cages (near-miss or regular) for polygonal faces with 6 to 20 edges and a deformation not exceeding 10%. The least iregular p-cages are shown in Table 6 and Table 7. The numbers of p-cages for each regular solid are listed in Table 8. The full description of all the p-cages with a deformation not exceeding 10% is listed in the Supplementary Materials. The Supplementary Materials also contains the coordinates of each p-cage as off files. In [7], p-cages were constructed without assuming the regularity of the faces, which could then be deformed differently from each others (P was ranging from 6 to 17 only). This potentially allows for less deformed p-cages than the symmetric ones. Most of the symmetric p-cages found here are similar to the p-cages found in [7] but there are a number of exceptions. A full comparison of the p-cages found here and in [7] is given in the Supplementary Materials. Sometimes the symmetric p-cages are slightly less deformed than the non-symmetric ones. This is due to the fact that the relaxation performed in [7] did not always find the least deformed p-cages. There are also examples where the non-symmetric p-cages are less deformed than the symmetric ones and close inspection of the faces of the non-symmetric p-cages shows that the faces are not identical, allowing for less deformed p-cages.
Most of the p-cages generated from the prisms and antiprisms look like two rings of faces joined together at the base, as shown in Table 6. Because the Platonic solids are dual of each other, the p-cages generated from them correspond to polygons placed on the faces of the dual solids of the hole-edge polyhedra. For the tetrahedron, the solid can be elongated while preserving the symmetry of the p-cage. This is also possible for the cube and the octahedron, but the corresponding p-cages are the ones built from the square prism and the square antiprism, respectively.
The p-cages generated from the Archimedean solids are overall more interesting. Notice that the only p-cages where the faces have five neighbors, the maximum allowed geometrically, are the p-cages generated from the snub cube and the snub dodecahedron. Asc_P11_2_1_1_1_1 (Table 7) is the least deformed one, with a deformation below 0.5%. All the other p-cages with five neighbors have deformations in excess of 2% (there are no regular p-cages with five neighbors).
Some of the Archimedean p-cages have a mesh-like structure, such as Atd_P17_2_6_6 for example. Others are more tightly packed, even when faces have only three neighbors, such as Ati_P16_4_2_7 where some of the hole-edges come very close together, but without touching each other.
By imposing a subgroup of the Platonic group as a symmetry to the p-cages we have substantially reduced the number of parameters required to describe the most general configurations, hence making the optimization process much less CPU intensive. The resulting p-cages are quite aesthetic and we hope they will be of interest to designers or architects, especially as they have congruent faces. Imposing the symmetry upfront will also be important for future work where one can construct p-cages made out of two or more different types of polygonal faces. One will first have to identify planar graphs made out of two or more types of nodes and identify the ones for which all the nodes belonging to the same family are equivalent. Even with only two types of polygons, the number of possible p-cages will be much larger than what we have described in this paper.

Supplementary Materials

The following supporting information is available in https://www.mdpi.com/article/10.3390/sym15030717/s1: It contains the files sym_pcages_sup_mat.pdf: Derivation of the possible symmetries of p-cages with Platonic and Archimedean hole-polyhedra; a list of all symmetric p-cage (P = 6 to 20) and a comparison between general p-cages and the symmetric ones. off_files.tar.gz: coordinates of all the p-cages as off files.

Author Contributions

B.M.A.G.P. derived the methods to analyze the near-miss symmetric p-cages and wrote the software to minimize the irregularity of the p-cage faces. Á.L. performed the group theory analysis of the hole polyhedron graphs and wrote the software to determine the constraints on the distribution of hole-edges. Conceptualization, B.M.A.G.P.; formal analysis, B.M.A.G.P.; funding acquisition B.M.A.G.P.; investigation, B.M.A.G.P., Á.L.; methodology, B.M.A.G.P., Á.L.; resources, B.M.A.G.P.; software, B.M.A.G.P., Á.L.; writing—original draft, B.M.A.G.P., Á.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Leverhulme Trust Research Project Grants RPG-2020-306.

Data Availability Statement

The software used to determine the coordinates of the least deformed p-cages is available from zenodo: https://zenodo.org/record/7602763#.Y9z6O63P1aQ, doi:10.5281/zenodo.7602763 (Last accessed 8 March 2023). The software to determine the distribution of hole-edges on the planar graphs is available from zenodo: https://zenodo.org/record/7616018, doi:10.5281/zenodo.7616018. (Last accessed 8 March 2023) The coordinates of all the near-miss p-cages with deformations below 10% are available as off files from zenodo: https://zenodo.org/record/7602851#.Y90Ci63P1aQ, doi:10.5281/zenodo.7602851. (Last accessed 8 March 2023).

Acknowledgments

The p-cage figures where generated using geomview from www.geomview.org accessed on 8 March 2023.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviation is used in this manuscript:
TRAPtrp RNA-binding attenuation protein.
RNARibonucleic acid: a nucleic acid present in all living cells.
DNADeoxyribonucleic acid: a nucleic acid present in all living cells.

References

  1. Malay, A.D.; Miyazaki, N.; Biela, A.; Chakraborti, S.; Majsterkiewicz, K.; Stupka, I.; Kaplan, C.S.; Kowalczyk, A.; Piette, B.M.; Hochberg, G.K.A.; et al. An ultra-stable gold-coordinated protein cage displaying reversible assembly. Nature 2019, 569, 438–442. [Google Scholar] [CrossRef] [PubMed]
  2. Malay, A.D.; Heddle, J.G.; Tomita, S.; Iwasaki, K.; Miyazaki, N.; Sumitomo, K.; Yanagi, H.; Yamashita, I.; Uraoka, Y. Gold nanoparticle-induced formation of artificial protein capsids. Nano Lett. 2012, 12, 2056–2059. [Google Scholar] [CrossRef] [PubMed]
  3. Imamura, M.; Uchihashi, T.; Ando, T.; Leifert, A.; Simon, U.; Malay, A.D.; Heddle, J.G. Probing structural dynamics of an artificial protein cage using high-speed atomic force microscopy. Nano Lett. 2015, 15, 1331–1335. [Google Scholar] [CrossRef] [PubMed]
  4. Antson, A.; Otridge, J.; Brzozowski, A.; Dodson, E.J.; Dodson, G.G.; Wilson, K.S.; Smith, T.M.; Yang, M.; Kurecki, T.; Gollnick, P. The structure of trp RNA-binding attenuation protein. Nature 1995, 374, 693–700. [Google Scholar] [CrossRef]
  5. Majsterkiewicz, K.; Biela, A.P.; Maity, S.; Sharma, M.; Piette, B.M.; Kowalczyk, A.; Gaweł, S.; Chakraborti, S.; Roos, W.H.; Heddle, J.G. Artificial protein cage with unusual geometry and regularly embedded gold nanoparticles. Nano Lett. 2022, 22, 3187–3195. [Google Scholar] [CrossRef]
  6. Sharma, A.P.; Biela, A.P.; Kowalczyk, A.; Borzecka-Solarz, K.; Piette, B.M.; Gaweł, S.; Bishop, J.; Kukura, P.; Benesch, J.L.P.; Imamura, M.; et al. Shape-morphing of an artificial protein cage with unusual geometry induced by a single amino acid change. ACS Nanoscience Au 2022, 2, 404–413. [Google Scholar] [CrossRef] [PubMed]
  7. Kowalczyk, A.; Piette, B.M.A.G.; Heddle, J.G. Characterization of near-miss connectivity-invariant homogeneous convex polyhedral cages. Proc. R. Soc. A 2022, 478, 20210679. [Google Scholar]
  8. Dey, S.; Fan, C.; Gothelf, K.V.; Li, J.; Lin, C.; Liu, L.; Liu, N.; Nijenhuis, M.A.D.; Saccà, B.; Simmel, F.C.; et al. DNA origami. Nat. Rev. Methods Primers 2021, 1, 13. [Google Scholar] [CrossRef]
  9. Hong, F.; Zhang, F.; Liu, Y.; Yan, H. DNA Origami: Scaffolds for creating higher order structures. Chem. Rev. 2017, 117, 12584–12640. [Google Scholar] [CrossRef]
  10. Tapio, K.; Bald, I. The potential of DNA origami to build multifunctional materials. Multifunct. Mater. 2020, 3, 032001. [Google Scholar] [CrossRef]
  11. Javan, A.R.; Liu, Y.; Xie, Y.M. New families of cage-like structures based on Goldberg polyhedra with non-isolated pentagons. J. Comput. Des. Eng. 2023. [Google Scholar] [CrossRef]
  12. Ham, R.; Nielsen, C.J.; Pullen, S.; Reek, J.N.H. Supramolecular coordination cages for artificial photosynthesis and synthetic photocatalysis. Chem. Rev. 2023. [Google Scholar] [CrossRef] [PubMed]
  13. Nakama, T.; Rossen, A.; Ebihara, R.; Yagi-Utsumi, M.; Fujita, D.; Kato, K.; Sato, S.; Fujita, M. Hysteresis behavior in the unfolding/refolding processes of a protein trapped in metallo-cages. Chem. Sci. 2023. [Google Scholar] [CrossRef]
  14. Sun, Y.L.; Wang, Z.; Ma, H.; Zhang, Q.P.; Yang, B.-B.; Meng, X.; Zhang, Y.; Zhang, C. Chiral emissive porous organic cages. Chem. Commun. 2023, 59, 302–305. [Google Scholar] [CrossRef] [PubMed]
  15. Zhang, X.; Li, X.; Su, S.; Tan, M.; Liu, G.; Wang, Y.; Luo, M. Ag nanoparticles in the cages of MIL-101 (Cr) as an efficient and stable photocatalyst for nitrogen reduction reaction. Catal. Sci. Technol. 2023, 13, 705–713. [Google Scholar] [CrossRef]
  16. Tang, X.; Meng, C.; Rampal, N.; Li, A.; Chen, X.; Gong, W.; Jiang, H.; Fairen-Jimenez, D.; Cui, Y.; Liu, Y. Homochiral porous metal–organic polyhedra with multiple kinds of vertices. J. Am. Chem. Soc. 2023, 145, 2561–2571. [Google Scholar] [CrossRef]
  17. Acharjee, D.; Das, A.; Panda, M.K.; Barai, M.; Ghosh, S. Facet engineering for decelerated carrier cooling in polyhedral perovskite nanocrystals. Nano Lett. 2023, 23, 1946–1953. [Google Scholar] [CrossRef]
  18. Zhang, Z.; Liao, J.; Xing, G. Regulating coordination geometry of polyhedron in zero-dimensional metal halides towards tunable emission. Nanoscale 2023. [Google Scholar] [CrossRef]
  19. Azeem, M.; Jamil, M.; Shang, Y. Notes on the localization of generalized hexagonal cellular networks. Mathematics 2023, 11, 844. [Google Scholar] [CrossRef]
  20. Fang, Y.; Zhang, Q.; Yang, H.; Zhuang, X.; Deng, S.; Zhang, W.; Qin, M.; Chen, Z.; Fan, X.; Chen, H. Molecular contrastive learning with chemical element knowledge graph. Proc. Aaai Conf. Artif. Intell. 2022, 36, 3968–3976. [Google Scholar] [CrossRef]
  21. Sintunavarat, W.; Turab, A. A unified fixed point approach to study the existence of solutions for a class of fractional boundary value problems arising in a chemical graph theory. PLoS ONE 2022, 17, e0270148. [Google Scholar] [CrossRef]
  22. Kwon, Y.; Lee, D.; Choi, Y.-S.; Kang, S. Uncertainty-aware prediction of chemical reaction yields with graph neural networks. J. Cheminform. 2022, 14, 1–10. [Google Scholar] [CrossRef] [PubMed]
  23. Liu, J.B. Novel applications of graph theory in chemistry and drug designing. Comb. Chem. High Throughput Screen. 2022, 25, 439–440. [Google Scholar] [CrossRef] [PubMed]
  24. Ramos-Sánchez, P.; Harvey, J.N.; Gámez, J.A. An automated method for graph-based chemical space exploration and transition state finding. J. Comput. Chem. 2023, 44, 27–42. [Google Scholar] [CrossRef] [PubMed]
  25. Merkys, A.; Vaitkus, A.; Grybauskas, A.; Konovalovas, A.; Quirós, M.; Gravzulis, S. Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions. J. Cheminform. 2023, 15, 1–13. [Google Scholar] [CrossRef] [PubMed]
  26. Schweidtmann, A.M.; Rittig, J.G.; Weber, J.M.; Grohe, M.; Dahmen, M.; Leonhard, K.; Mitsos, A. Physical pooling functions in graph neural networks for molecular property prediction. Comput. Chem. Eng. 2023, 172, 108202. [Google Scholar] [CrossRef]
  27. Trinajstic, N. Chemical Graph Theory; CRC Press: Boca Raton, FL, USA, 2018. [Google Scholar]
  28. Nadeem, M.F.; Shabbir, A.A. Computing and comparative analysis of topological invariants of Y-junction carbon nanotubes. Int. J. Quantum Chem. 2022, 122, e26847. [Google Scholar] [CrossRef]
  29. Mohammed, M.A.; Munshid, A.J.; Siddiqui, H.M.A.; Farahani, M.R. Computing metric and partition dimension of tessellation of plane by boron nanosheets. Eurasian Chem. Commun. 2020, 2, 1064–1071. [Google Scholar]
  30. Deutsch, E.; Klavžar, S. M-polynomial and degree-based topological indices. Iran. J. Math. Chem. 2015, 6, 93–102. [Google Scholar] [CrossRef]
  31. Irfan, M.; Rehman, H.U.; Almusawa, H.; Rasheed, S.; Baloch, I.A. M-polynomials and topological indices for line graphs of chain silicate Network and H-Naphtalenic Nanotubes. Topol. Indices Appl. Graph Theory 2021, 2021, 5551825. [Google Scholar] [CrossRef]
  32. Mondal, S.; Muhammad Imran, M.; De, N.; Pal, A. Neighborhood M-polynomial of titanium compounds. Arab. J. Chem. 2021, 14, 103244. [Google Scholar] [CrossRef]
  33. Munir, M.; Nazeer, W.; Nizami, A.R.; Rafique, S.; Kang, S.M. M-polynomial and related topological indices of nanostar dendrimers. Symmetry 2016, 8, 97. [Google Scholar] [CrossRef]
  34. Munir, M.; Nazeer, W.; Nizami, A.R.; Rafique, S.; Kang, S.M. M-polynomial and degree-based topological indices of polyhex nanotubes. Symmetry 2016, 8, 149. [Google Scholar] [CrossRef]
  35. Siddiqui, M.K.; Imran, M.; Ahmad, A. On Zagreb indices, Zagreb polynomials of some nanostar dendrimers. Appl. Math. Comput. 2016, 280, 132–139. [Google Scholar]
  36. Coxeter, H.S.M. Regular Polytopes; Dover Publications: Mineola, NY, USA, 1973. [Google Scholar]
  37. Magnus, W.; Karrass, A.; Solitar, D. Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations; Dover: New York, NY, USA, 2004. [Google Scholar]
  38. The representation of finite groups, especially of the rotation groups of the regular bodies of three-and four-dimensional space, by Cayley’s color diagrams. Amer. J. Math. 1896, 18, 156–194. [CrossRef]
  39. Armstrong, M.A. Groups and Symmetry; Springer: New York, NY, USA, 1988. [Google Scholar]
  40. Hamermesh, M. Group Theory and Its Application to Physical Problems; Addison-Wesley Publishing Co., Inc.: Reading, MA, USA, 1962. [Google Scholar]
  41. The GAP Group. GAP-Groups, Algorithms, and Programming. Version 4.10.2. 2019. Available online: https://www.gap-system.org (accessed on 8 March 2023).
  42. Norton, S.P.; Parker, R.A.; Conway, J.H.; Curtis, R.T.; Wilson, R.A. Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Group; Clarendon Press Oxford: Oxford, UK, 1985. [Google Scholar]
Figure 1. (a): schematic construction of the hole polyhedra of a p-cage. The number of hole-edges of the top left face is given for each hole to which the face contributes (the hole-edges for that face are orange on the figure). (b): the corresponding planar graph with the number of hole-edges around each vertex.
Figure 1. (a): schematic construction of the hole polyhedra of a p-cage. The number of hole-edges of the top left face is given for each hole to which the face contributes (the hole-edges for that face are orange on the figure). (b): the corresponding planar graph with the number of hole-edges around each vertex.
Symmetry 15 00717 g001
Figure 2. (a,b), the two Possible distributions, modulo a 2 π / 3 rotation around the vertex, of the hole-edges when placing an octagon on a trivalent vertex such as a tetrahedron.
Figure 2. (a,b), the two Possible distributions, modulo a 2 π / 3 rotation around the vertex, of the hole-edges when placing an octagon on a trivalent vertex such as a tetrahedron.
Symmetry 15 00717 g002
Figure 3. Distribution of the hole-edges on the (a) prism and (b) antiprism. n corresponds to the number of edges of the base of the prism.
Figure 3. Distribution of the hole-edges on the (a) prism and (b) antiprism. n corresponds to the number of edges of the base of the prism.
Symmetry 15 00717 g003
Figure 4. Distribution of the hole-edges on the Platonic solids: (a) the tetrahedron, (b) the cube (the square prism), (c) the octahedron (as a triangular antiprism (d)) but also a specific distribution), (e) the dodecahedron, and (f) the icosahedron.
Figure 4. Distribution of the hole-edges on the Platonic solids: (a) the tetrahedron, (b) the cube (the square prism), (c) the octahedron (as a triangular antiprism (d)) but also a specific distribution), (e) the dodecahedron, and (f) the icosahedron.
Symmetry 15 00717 g004
Figure 5. Distribution of the hole-edges on the Archimedean solids. (a) the truncated cube, (b) the truncated dodecahedron, (c) the rhombicosidodecahedron, (d) the truncated icosahedron, (e) the snub dodecahedron, (f) the cubocatahedron, (g) the icosidodecahedron, (h) the snub cube, (i) the truncated cube, (j) the rhombicuboctahedron, and (k) the truncated octahedron.
Figure 5. Distribution of the hole-edges on the Archimedean solids. (a) the truncated cube, (b) the truncated dodecahedron, (c) the rhombicosidodecahedron, (d) the truncated icosahedron, (e) the snub dodecahedron, (f) the cubocatahedron, (g) the icosidodecahedron, (h) the snub cube, (i) the truncated cube, (j) the rhombicuboctahedron, and (k) the truncated octahedron.
Symmetry 15 00717 g005
Figure 6. (a) Parametrization of a tent. The edges joining n 1 to n 2 , n 3 to n 4 , and n 5 to n 6 , are shared edges. The edges adjacent to a i , b i , and c i are hole-edges. θ is the inclination of the face with respect to the pyramid base. (b) Coordinate frame.
Figure 6. (a) Parametrization of a tent. The edges joining n 1 to n 2 , n 3 to n 4 , and n 5 to n 6 , are shared edges. The edges adjacent to a i , b i , and c i are hole-edges. θ is the inclination of the face with respect to the pyramid base. (b) Coordinate frame.
Symmetry 15 00717 g006
Figure 7. Tetrahedron inside a cube.
Figure 7. Tetrahedron inside a cube.
Symmetry 15 00717 g007
Figure 8. Face of an icosahedron p-cage.
Figure 8. Face of an icosahedron p-cage.
Symmetry 15 00717 g008
Figure 9. Triangular tents placed on the faces of an octahedron for the p-cage constructed from the truncated cube.
Figure 9. Triangular tents placed on the faces of an octahedron for the p-cage constructed from the truncated cube.
Symmetry 15 00717 g009
Figure 10. (a) Parametrization of the cuboctahedron p-cage face. (b) Distribution of hole-edges.
Figure 10. (a) Parametrization of the cuboctahedron p-cage face. (b) Distribution of hole-edges.
Symmetry 15 00717 g010
Figure 11. (a) Parametrization of the icosidodecahedron p-cage face. (b) Distribution of hole-edges.
Figure 11. (a) Parametrization of the icosidodecahedron p-cage face. (b) Distribution of hole-edges.
Symmetry 15 00717 g011
Figure 12. (a) Parametrization of the rhombicuboctahedron p-cage face. (b) Distribution of hole-edges.
Figure 12. (a) Parametrization of the rhombicuboctahedron p-cage face. (b) Distribution of hole-edges.
Symmetry 15 00717 g012
Figure 13. (a) Parametrization of the rhombicosidodecahedron p-cage face. (b) Distribution of hole-edges.
Figure 13. (a) Parametrization of the rhombicosidodecahedron p-cage face. (b) Distribution of hole-edges.
Symmetry 15 00717 g013
Figure 14. (a) Parametrization of the snub cube p-cage face. (b) Distribution of hole-edges.
Figure 14. (a) Parametrization of the snub cube p-cage face. (b) Distribution of hole-edges.
Symmetry 15 00717 g014
Figure 15. (a) Parametrization of the snub dodecahedron p-cage face. Base of the dodecahedron. (b) Distribution of hole-edges. (c) Vectors on the face.
Figure 15. (a) Parametrization of the snub dodecahedron p-cage face. Base of the dodecahedron. (b) Distribution of hole-edges. (c) Vectors on the face.
Symmetry 15 00717 g015
Table 1. Symbols for convex uniform solids.
Table 1. Symbols for convex uniform solids.
SolidSYMSolidSYM
Triangular PrismtpTetrahedronPte
Square Prism (cube)spOctahedronPoc
Pentagonal PrismppDodecahedronPdo
Hexagonal PrismhpIcosahedronPic
Heptagonal Prism7pTruncated CubeAtc
Octagonal Prism8pTruncated TetrahedronAtt
Nonagonal Prism9pTruncated OctahedronAto
Decagonal Prism10pTruncated DodecahedronAtd
Triangular AntiprismtaTruncated IcosahedronAti
Square AntiprismsaSnub CubeAsc
Pentagonal AntiprismpaSnub DodecahedronAsd
Hexagonal AntiprismhaCuboctahedronAco
Heptagonal Antiprism7aRhombicuboctahedronArco
Octagonal Antiprism8aRhombicosidodecahedronArcd
Nonagonal Antiprism9aIcosidodecahedronAid
Decagonal Antiprism10a
Table 2. Symmetry groups and their transitive subgroups for p-cages with Platonic hole-polyhedra.
Table 2. Symmetry groups and their transitive subgroups for p-cages with Platonic hole-polyhedra.
Hole-PolyhedronSymmetry
(Group)
OrderTransitive
(Subgroups)
OrderLabel Clashes
prism D n 2 n
anti-prism D n 2 n
tetrahedron A 4 12 C 2 × C 2 4
A 4 12all
cube S 4 24 D 8 16
S 4 24all
octahedron S 4 244 S 3 ≡ 4 D 3 6
A 4 12two pairs
S 4 24all
dodecahedron A 5 60 all
icosahedron A 5 60 A 4 12
A 5 60all
Table 3. Symmetry groups and their transitive subgroups for p-cages with Archimedean hole-polyhedra. G denotes the full symmetry group of the hole-polyhedron and H the transitive subgroup considered.
Table 3. Symmetry groups and their transitive subgroups for p-cages with Archimedean hole-polyhedra. G denotes the full symmetry group of the hole-polyhedron and H the transitive subgroup considered.
Hole PolyhedronSymmetry TypeG | G | H G | H | Label cl’s.
truncated tetrahedrontetrahedron A 4 12
truncated cubecube S 4 24
truncated octahedronoctahedron S 4 24
truncated dodecahedrondodecahedron A 5 60
truncated icosahedronicosahedron A 5 60
cuboctahedroncube S 4 24 A 4 12
S 4 24two pairs
rhombicuboctahedroncube S 4 24
snub cubecube S 4 24
icosidodecahedrondodecahedron A 5 60 two-pairs
rhombicosidodecahedrondodecahedron A 5 60
snub dodecahedrondodecahedron A 5 60
Table 4. List of regular flat prism p-cages. See the Supplementary Materials for the full list of non-planar p-cages.
Table 4. List of regular flat prism p-cages. See the Supplementary Materials for the full list of non-planar p-cages.
N34456666681010
P128162069121518161920
q a 113512345537
q b 425612345425
q c 425612345425
Table 5. Inner radius, r i , inner face radius, r f , and dihedral angle of Platonic solid of edge length 1. ϕ g = ( 1 + 5 ) / 2 .
Table 5. Inner radius, r i , inner face radius, r f , and dihedral angle of Platonic solid of edge length 1. ϕ g = ( 1 + 5 ) / 2 .
Solid r i r f ϕ d
Tetrahedron 1 / 24 1 / ( 2 tan ( π 3 ) ) 2 arctan ( 1 / 2 )
Cube 1 / 2 1 / 2 π / 2
Octahedron 1 / 6 1 / ( 2 tan ( π 3 ) ) 2 arctan ( 2 )
Dodecahedron ϕ g 2 / ( 2 3 ϕ g ) 1 / ( 2 tan ( π 5 ) ) 2 arctan ( ϕ g )
Icosahedron ϕ g 2 / 12 1 / ( 2 tan ( π 3 ) ) 2 arctan ( ϕ g 2 )
Table 6. Least irregular p-cages built from prisms and antiprisms solid hole polyhedra.
Table 6. Least irregular p-cages built from prisms and antiprisms solid hole polyhedra.
Symmetry 15 00717 i001
tp_P17_3_5_6
Δ l = 0.00120
Δ a = 0.00120
Symmetry 15 00717 i002
sp_P18_5_4_6
Δ l = 0.00224
Δ a = 0.00224
Symmetry 15 00717 i003
pp_P18_6_4_5
Δ l = 0.00012
Δ a = 0.00012
Symmetry 15 00717 i004
hp_P19_7_4_5
Δ l = 0.00038
Δ a = 0.00038
Symmetry 15 00717 i005
7p_P18_7_3_5
Δ l = 0.00195
Δ a = 0.00195
Symmetry 15 00717 i006
8p_P20_8_4_5
Δ l = 0.00214
Δ a = 0.00214
Symmetry 15 00717 i007
9p_P15_6_2_4
Δ l = 0.00145
Δ a = 0.00145
Symmetry 15 00717 i008
10p_P17_7_3_4
Δ l = 0.00054
Δ a = 0.00054
Symmetry 15 00717 i009
ta_P19_3_4_4_4
Δ l = 0.02502
Δ a = 0.02504
Symmetry 15 00717 i010
sa_P14_4_2_2_2
Δ l = 0.00731
Δ a = 0.00731
Symmetry 15 00717 i011
pa_P19_6_3_3_3
Δ l = 0.02698
Δ a = 0.02701
Symmetry 15 00717 i012
ha_P16_6_2_2_2
Δ l = 0.01074
Δ a = 0.01074
Symmetry 15 00717 i013
7a_P16_6_2_2_2
Δ l = 0.0128622
Δ a = 0.0128754
Symmetry 15 00717 i014
8a_P11_4_1_1_1
Δ l = 0.00800
Δ a = 0.00800
Symmetry 15 00717 i015
9a_P17_7_2_2_2
Δ l = 0.00433
Δ a = 0.00433
Symmetry 15 00717 i016
10a_P17_7_2_2_2
Δ l = 0.00385
Δ a = 0.00385
Table 7. Least irregular p-cages built from Platonic and Archimedean solid hole polyhedra.
Table 7. Least irregular p-cages built from Platonic and Archimedean solid hole polyhedra.
Symmetry 15 00717 i017
Pte_P20_5_6_6
Δ l = 0.03912
Δ a = 0.03912
Symmetry 15 00717 i018
Poc2_P18_3_4_3_4
Δ l = 0
Δ a = 0.01563
Symmetry 15 00717 i019
Pic_P18_2_3_2_3_3
Δ l = 0.04420
Δ a = 0.04422
Symmetry 15 00717 i020
Att_P16_2_5_6
Δ l = 0.00055
Δ a = 0.00055
Symmetry 15 00717 i021
Atc_P17_2_4_8
Δ l = 0.00057
Δ a = 0.00060
Symmetry 15 00717 i022
Ato_P15_3_4_5
Δ l = 0.00110
Δ a = 0.00110
Symmetry 15 00717 i023
Atd_P17_2_6_6
Δ l = 0.00006
Δ a = 0.00020
Symmetry 15 00717 i024
Ati_P16_4_2_7
Δ l = 0.00042
Δ a = 0.00042
Symmetry 15 00717 i025
Aco_P17_2_4_3_4
Δ l = 0
Δ a = 0.00083
Symmetry 15 00717 i026
Aid_P18_2_5_2_5
Δ l = 0
Δ a = 0.00716
Symmetry 15 00717 i027
Arcd_P16_2_3_4_3
Δ l = 0.00653
Δ a = 0.00653
Symmetry 15 00717 i028
Arco_P11_1_2_2_2
Δ l = 0.00020
Δ a = 0.00109
Symmetry 15 00717 i029
Asc_P11_2_1_1_1_1
Δ l = 0.00499
Δ a = 0.00273
Symmetry 15 00717 i030
Asd_P16_4_2_1_2_2
Δ l = 0.03597
Δ a = 0.05405
Table 8. Number of p-cages for each hole-edge regular solid. P = 6 to 20. n is the total number of symmetric p-cages with a deformation smaller or equal to 10%, including regular p-cages. n r is the total number of regular p-cages (no deformations).
Table 8. Number of p-cages for each hole-edge regular solid. P = 6 to 20. n is the total number of symmetric p-cages with a deformation smaller or equal to 10%, including regular p-cages. n r is the total number of regular p-cages (no deformations).
Hole-Edge Solidn n R Hole-Edge Solidn n R
Triangular Prism14039Tetrahedron185
Square Prism12528Cube=Square Prism(125)(28)
Pentagonal Prism11425Octahedron114
Hexagonal Prism10721Dodecahedron55
Heptagonal Prism10116Icosahedron163
Octagonal Prism9215Truncated Tetrahedron1089
Nonagonal Prism8613Truncated Cube1032
Decagonal Prism8013Truncated Octahedron1227
Triangular Antiprism424Truncated Dodecahedron1021
Square Antiprism310Truncated Icosahedron1241
Pentagonal Antiprism293Cuboctahedron1934
Hexagonal Antiprism260Rhombicuboctahedron2325
Heptagonal Antiprism240Snub Cube690
Octagonal Antiprism230Snub Dodecahedron100
Nonagonal Antiprism210Icosidodecahedron190
Decagonal Antiprism200Rhombicosidodecahedron1781
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Piette, B.M.A.G.; Lukács, Á. Near-Miss Symmetric Polyhedral Cages. Symmetry 2023, 15, 717. https://doi.org/10.3390/sym15030717

AMA Style

Piette BMAG, Lukács Á. Near-Miss Symmetric Polyhedral Cages. Symmetry. 2023; 15(3):717. https://doi.org/10.3390/sym15030717

Chicago/Turabian Style

Piette, Bernard M. A. G., and Árpad Lukács. 2023. "Near-Miss Symmetric Polyhedral Cages" Symmetry 15, no. 3: 717. https://doi.org/10.3390/sym15030717

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop