Symmetry 2012, 4, 208-218; doi:10.3390/sym4010208

OPEN ACCESS

symmetry

ISSN 2073-8994

www.mdpi.com/journal/symmetry

Article

Self-Dual, Self-Petrie Covers of Regular Polyhedra

Gabe Cunningham

Northeastern University, 360 Huntington Ave, Boston, MA 02115, USA; E-Mail: gabriel.cunningham@gmail.com; Tel.: +1 617-406-9067

Received: 17 January 2012; in revised form: 21 February 2012 / Accepted: 23 February 2012 / Published: 27 February 2012

Abstract: The well-known duality and Petrie duality operations on maps have natural analogs for abstract polyhedra. Regular polyhedra that are invariant under both operations have a high degree of both "external" and "internal" symmetry. The mixing operation provides a natural way to build the minimal common cover of two polyhedra, and by mixing a regular polyhedron with its five other images under the duality operations, we are able to construct the minimal self-dual, self-Petrie cover of a regular polyhedron. Determining the full structure of these covers is challenging and generally requires that we use some of the standard algorithms in combinatorial group theory. However, we are able to develop criteria that sometimes yield the full structure without explicit calculations. Using these criteria and other interesting methods, we then calculate the size of the self-dual, self-Petrie covers of several polyhedra, including the regular convex polyhedra.

Keywords: abstract polyhedron; convex polyhedron; duality; map operations; mixing; Petrie polygon; Petrie dual

1. Introduction

Abstract polyhedra are partially-ordered sets that generalize the face-lattices of convex polyhedra. They are closely related to maps on surfaces (i.e., 2-cell decompositions of surfaces), and indeed, every abstract polyhedron has a natural realization as such a map. The regular polyhedra are the most extensively studied. These are the polyhedra such that the automorphism group acts transitively on the flags (which consist of a vertex, an edge, and a face that are all mutually incident). There is a natural way to build a regular polyhedron from a finitely generated group satisfying certain properties, yielding a bijection between (isomorphism classes of) regular polyhedra and such groups. The ability to view

a regular polyhedron as either a map on a surface or as a group has fostered the development of a rich theory.

The well-known duality and Petrie duality operations on maps can be easily applied to polyhedra, though in some rare cases, the Petrie dual of a polyhedron is not a polyhedron. A regular polyhedron that is invariant under both operations has a high degree of "external" symmetry in addition to the "internal" symmetry that regularity measures. In [1], the authors describe a way to build a self-dual, self-Petrie cover of a regular map. Using a similar construction, we show how to build a self-dual, self-Petrie cover of a regular polyhedron. Determining the local structure of the cover is simple. However, finding a presentation for the automorphism group of the cover is generally infeasible. Therefore, our goal is to develop criteria that give us information about the cover without requiring direct calculation.

We start by giving some background on abstract polyhedra, regularity, and the duality operations in Section 2. In Section 3, we present the mixing operation for regular polyhedra and show how to use it to construct self-dual, self-Petrie covers. We then show how to calculate the size of these covers in certain cases. Finally, in Section 4 we calculate the size of the self-dual, self-Petrie covers of several polyhedra, including the regular convex polyhedra.

2. Abstract Polyhedra

Let P be a ranked partially ordered set of vertices, edges, and faces, which have rank 0, 1, and 2, respectively. If F < G or G < F, we say that F and G are incident. A flag of P is a maximal chain, and two flags are adjacent if they differ in exactly one element. We say that P is an (abstract) polyhedron if it satisfies the following properties:

1. Each flag of P consists of a vertex, an edge, and a face.

2. Each edge is incident on exactly two vertices and two faces.

3. If F is a vertex and G is a face such that F < G, then there are exactly two edges that are incident to both F and G.

4. P is strongly flag-connected, meaning that if $ and ^ are two flags of P, then there is a sequence of flags $ = $0, $i,..., $k = ^ such that for i = 0,..., k - 1, the flags $, and $i+1 are adjacent, and each contains $ n

As a consequence of the second and third properties above, every flag $ has a unique flag $* that differs from $ only in its element of rank i. We say that $* is i-adjacent to $.

For polyhedra P and Q, an isomorphism from P to Q is an incidence- and rank-preserving bijection, and an isomorphism from P to itself is an automorphism. We denote the group of all automorphisms of P by r(P). There is a natural action of r(P) on the flags of P, and we say that P is regular if this action is transitive. The faces of a regular polyhedron all have the same number of sides, and the vertices all have the same valency. In general, we say that a polyhedron is of type {p, q} if every face is a p-gon and every vertex is q-valent.

Given a regular polyhedron P, fix a base flag $. Then the automorphism group r(P) is generated by involutions p0, pi, and p2, where pi maps the base flag $ to $. This completely determines the action

of each pi on all flags, since for any automorphism and flag

If P is of type {p, q}, then these generators satisfy (at least) the relations

(PoPi)p = (P0P2)2 = (PiP2)q = e

If these are the only defining relations, then we denote P by {p, q}, and r(P) is a Coxeter group, denoted [p, q]. We note that whenever P is the face-lattice of a regular convex polyhedron, then its denotation is the same as the usual Schlafli symbol for that polyhedron (see [2]).

For I C {0,1,2} and a group r = (p0,pi,p2), we define r := (pi | i G I). The strong flag-connectivity of polyhedra induces the following intersection property in the group:

ri n rj = r/nj for I, J C {0,1, 2} (1)

In general, if r = (p0, pi, p2) is a group such that each pi has order 2 and such that (p0p2)2 = e, then we say that r is a string group generated by involutions on 3 generators (or sggi). If r also satisfies the intersection property given above, then we call r a string C-group on 3 generators. There is a natural way of building a regular polyhedron P (r) from a string C-group r such that r(P (r)) = r [3] (Theorem 2E11). Therefore, we get a one-to-one correspondence between regular polyhedra and string C-groups on 3 specified generators.

Let P and Q be two polyhedra (not necessarily regular). A function 7 : P ^ Q is called a covering if it preserves adjacency of flags, incidence, and rank; then 7 is necessarily surjective, by the flag-connectedness of Q. We say that P covers Q if there exists a covering 7 : P ^ Q. If P and Q are both regular polyhedra, then their automorphism groups are both quotients of

W := [ro, ro] = (po,Pi,P2 | P2 = P2 = P2 = (P0P2)2 = e)

Therefore there are normal subgroups M and K of W such that r(P) = W/M and r(Q) = W/K. Then P covers Q if and only if M < K.

2.1. Duality Operations

There are two well-known duality operations on maps on surfaces, described in [1] and earlier articles. These naturally give rise to corresponding operations on polyhedra. The first is known simply as duality, and the dual of P (denoted P5) is obtained from P by reversing the partial order. If a polyhedron is isomorphic to its dual, then it is called self-dual.

In order to formulate the second duality operation, we need to define the Petrie polygons of a polyhedron. Consider a walk along edges of the polyhedron such that at each successive step, we alternate between taking the first exit on the left and the first exit on the right. When we start with a

finite polyhedron, such a walk will eventually take us to a vertex we have already visited, leaving in the same direction as we have before. This closed walk is one of the Petrie polygons of the polyhedron.

We can now describe the second duality operation. Given a polyhedron P, its Petrie dual Pn consists of the same vertices and edges as P, but its faces are the Petrie polygons of P. Taking the Petrie dual of a polyhedron also forces the old faces to be the new Petrie polygons, so that P~ P .If P is isomorphic to Pn, then we say that P is self-Petrie.

Since Petrie polygons play a central role in this paper, we expand some of our earlier terminology. If P is a regular polyhedron, then its Petrie polygons all have the same length, and that length is the order of P0P1P2 in r(P). A regular polyhedron of type {p, q} and with Petrie polygons of length r is also said to be of type {p, q}r. If P is of type {p, q}r and it covers every other polyhedron of type {p, q}r, then we call it the universal polyhedron of type {p, q}r and we denote it by {p, q}r. The automorphism group of {p, q}r is denoted by [p, q]r, and this group is the quotient of [p, q] by the single extra relation (p0p1p2)r = e. We will also extend our notation and use [p, q]r for the group with presentation

(Po,Pl,P2 | P2 = p1 = P2 = (PoPi)p = (P0P2)2 = (PiP2)q = (PoPiP2)r = e)

even when there is no universal polyhedron of type {p, q}r.

The operations 5 and n form a group of order 6, isomorphic to S3. A regular polyhedron that is self-dual and self-Petrie is invariant under all 6 operations; such a polyhedron must be of type {n, n}n for some n > 2. In general, if P is of type {p, q}r, then P5 is of type {q,p}r, and Pn is of type {r, q}p. Furthermore, the dual and the Petrie dual of a universal polyhedron is again universal.

3. Mixing Polyhedra

The mixing construction on polyhedra is analogous to the join of two maps or hypermaps [4]. Using it, we can find the minimal common cover of two or more polyhedra, which will enable us to describe the self-dual, self-Petrie covers of regular polyhedra.

We begin by describing the mixing operation on groups (also called the parallel product in [5]). Let P and Q be regular polyhedra with r(P) = (po,Pi,P2) and r(Q) = (p0, pi, p'2). Let a, = (pi,pi) E r(P) x r(Q) for i E {0,1, 2}. Then we define the mix of r(P) and r(Q) to be the group

r(P) o r(Q) := (a0,ai,«2)

Note that the order of any word ai1... ait is the least common multiple of the orders of pix... pit and pix... pit. In particular, each a, is an involution, and (a0a2)2 = e. Therefore, r(P) o r(Q) is a string group generated by involutions. As we shall see, it also satisfies the intersection property (Equation (1)). Recall that r7 := (p, | i E I).

Proposition 3.1. Let P and Q be regular polyhedra, and let I, J C {0,1, 2}. Let A = r(P), A = r(Q), and r = A o A. Then r n rj C A/nj x A^j.

Proof. Let g E Г/ П rj, and write g = (gi, g2). Then g! E Л/ П ЛJ and g2 E А/ П Aj. Now, since P and Q are polyhedra, we have that Л/ П Л J = Л/nJ and А/ П A J = A/n J. Therefore, g E Л/nJ x А/nJ. □

Corollary 3.2. Let P and Q be regular polyhedra. Let Л = Г(Р), A = r(Q), and Г = Л о A. Then Г satisfies the intersection property (Equation (1)).

Proof. Let Л = (p0,pi,p2) and let A = (p0,p1,p2). Let Г = (а0,аьа2). We need to show that for subsets I and J of N = {0,1, 2}, Г/ П ГJ < r/nJ. If I П J = 0, the claim follows immediately from Proposition 3.1. If I С J, the claim also clearly holds. The only remaining case is when I = N \ {i} and J = N \{j} for i = j. We will prove the case I = {0,1} and J = {1, 2}; the other cases are similar. Now, from Proposition 3.1, we know that Г/ П ГJ С (p1) x (p/). We want to show that (p1,e) and (e,p1) are not in Г/ П ГJ. We have that Л/ = (p0, p1), which is a dihedral group. In particular, all relations of Л/ have even length. The same is true of A/. Therefore, when we reduce a word (pil... pik ,p'il... p'ik) in Г/, the length of each component must have the same parity. In particular, we cannot have (p1, e) G Г/ or (e, p/) G Г/. Therefore, Г/ П ГJ < (a1), which is what we wanted to show. □

Since the group Г(Р) о ^Q) satisfies the intersection property, we can build a regular polyhedron from the group. We call this polyhedron the mix of P and Q, and we denote it P о Q. By construction, Г(Р о Q) = Г(Р) о ^Q).

Note that whether we mix P and Q as regular polyhedra, or take their join as maps, we get the same structure. Therefore, Corollary 3.2 tells us that when we take the join of two maps that correspond to polyhedra, we get another map that corresponds to a polyhedron.

There is another way to describe the mix of ^P) and ^Q) using quotients of the group W, which was described in Section 2. Let P and Q be regular polyhedra with ^P) = W/M and ^Q) = W/K. Then the homomorphism from W to W/M x W/K, sending a word w to the pair of cosets (wM, wK), has kernel M П K and image W/M о W/K. Thus we see that ^P) о ВД) ~ W/(M П K). Therefore, P о Q is the minimal regular polyhedron that covers both P and Q.

Now we can describe how to construct the self-dual, self-Petrie cover of a polyhedron. Let G = (5, n), the group of polyhedron operations generated by duality and Petrie duality, and let P be a regular polyhedron with ^P) = W/M. For any <p G G, define Pv to be the regular poset (usually a polyhedron) built from the group W/<p(M). Now consider

P* := P о P5 о Pп о Pо Pп<5 о P Then Г^*) is the quotient of W by

M П 5(M) П n(M) П 5n(M) П n5(M) П 5n5(M)

and since this subgroup is fixed by both 5 and n, it follows that P* is self-dual and self-Petrie. Now, if Pn and Pare both polyhedra, then Corollary 3.2 tells us that P* is also a polyhedron. In the rare cases where Pn is not a polyhedron, we can use the "quotient criterion" [3, Theorem 2E17] to show that PоPn is nevertheless a polyhedron, since the natural epimorphism from ^P) о ^Pn) = (a0, a1, a2) to ^P) is one-to-one on the subgroup (a1,a2). In any case, P* is the minimal regular, self-dual, self-Petrie polyhedron that covers P.

If P is a regular polyhedron of type {p, q}r, then P* is of type {n, n}n, where n is the least common multiple of p, q, and r. This gives us a full picture of the local structure of P*. Determining the global

structure, such as the size, isomorphism type, and presentation of r(P*), is much more challenging. With the tools presented so far, the only way we can determine r(P*) is by looking at the intersection of six subgroups of W, or finding the diagonal subgroup of the direct product of six groups. Neither alternative is feasible in general.

There is another construction, dual to mixing, that helps us calculate the size of r(P) or(Q). If r(P) has presentation (p0, p^ p2 | R) and r(Q) has presentation (p0, pi, p'2 | S), then we define the comix of r(P) and r(Q), denoted r(P) □ r(Q), to be the group with presentation

(po,p0,pi,pi,p2 ,p2 1 R,S,p-i p0,prip/i,p-1p/2)

Informally speaking, we can just add the relations from r(Q) to those of r(P), rewriting them to use Pi in place of pi. As a result, the order of any word pi1... pit in r(P) □ r(Q) divides the order of the corresponding word in r(P) and in r(Q).

Like the mix of two groups, the comix has a natural interpretation in terms of quotients of W. In particular, if r(P) = W/M and r(Q) = W/K, then r(P) □ r(Q) = W/MK. That is, r(P) □ r(Q) is the maximal common quotient of r(P) and r(Q) (with respect to the natural covering maps).

Proposition 3.3. Let P and Q be finite regular polyhedra. Then

|r(P) o r(Q)| ■ |r(P) □ r(Q)| = |r(P)| ■ |r(Q)| Furthermore, if r(P) □ r(Q) is trivial, then r(P) o r(Q) = r(P) x r(Q).

Proof. Let r(P) = W/M and r(Q) = W/K. Then r(P) o r(Q) = W/(M n K) and r(P) □ r(Q) = W/MK. Let f : r(P) o r(Q) ^ r(P) and g : r(Q) ^ r(P) □ r(Q) be the natural epimorphisms. Then ker f ~ M/(M n K) and ker g ~ MK/K ~ M/(M n K). Therefore, we have that

|r(P) o r(Q)| = |r(P)|| ker f | = |r(P)|| kerg|

= |r(P)||r(Q)|/|r(P) □ r(Q)|

and the result follows. □

Using Proposition 3.3, it is often possible to determine the size of r(P) o r(Q) by hand or with the help of a computer algebra system. However, since finding the comix of two groups usually requires that we know their presentations, the result is somewhat less useful for determining the size of r(P*), which is the mix of six groups. In a few nice cases, though, we can determine the size or structure of r(P*) without any difficult calculations. We present a few such results here.

Theorem 3.4. Let P be a self-Petrie polyhedron of type {p, q}p. Suppose p is odd and that p and q are coprime. Then

r(P*) = r(P) x r(P5) x r(P5n)

Proof. First, we note that P5 is of type {q,p}p. In r(P) □ r(P5), the order of p0pi divides p and q, and since p and q are coprime, we get p0pi = e; that is, p0 = pi. Similarly, pip2 = e, and so pi = p2.

Now, the order of P0P1P2 divides p. On the other hand, p0pip2 = p0 = Po, and so the order divides 2 as well. Therefore, we must have that p0p1 p2 = e. This forces all of the generators to be trivial, and thus r(P) □ r(P5) is trivial and r(P) o r(P5) = r(P) x r(P5).

Now, PoP5 is of type {pq,pq}p, and P5n is of type {p,p}q. Then in their comix, we get that p0p1p2 has order dividing p and q, and thus it is trivial. Thus p0 = p1p2, and so (p1p2)2 = e. On the other hand, we also have that (p1p2)p = e in the comix, and since p is odd, this means that p1p2 is trivial. So p0 is trivial, and p1 = p2. Similarly, p2 = p0p1, and thus (p0p1)2 = e. But again, we also have that (p0P1)p = e, and thus p0p1 = e. So p0 = p1 = p2 = e and we see that the comix is trivial. Therefore, the mix is the direct product r(P) x r(P5) x r(P5n).

Finally, we note that since P is self-Petrie, we have Pn = P, Pn5 = P5, and Pn5n = P5n. Therefore, the self-dual, self-Petrie cover of P consists of just the three distinct polyhedra we have mixed. □

Corollary 3.5. Let P be a regular polyhedron of type {p, q}r. Suppose p and r are odd and both coprime to q. Let Q = P o Pn. Then

r(P*) = r(Q) x r(Q5) x r(Q5n)

Proof. We start by noting that any self-dual, self-Petrie polyhedron that covers P must also cover Q; therefore, P* = Q*. Now, the polyhedron Q is a self-Petrie polyhedron of type {t, q}^, where t is the least common multiple of p and r. Since p and r are both odd and coprime to q, t is also odd and coprime to q. Then we can apply Theorem 3.4 and the result follows. □

The condition in Theorem 3.4 that p is odd is essential. When p is even, we cannot tell from the type alone whether r(P) □ r(P5) has order 1 or 2. However, if P is the universal polyhedron of type {p, q}p, then we can still determine |r(P*) |.

Theorem 3.6. Let P = {p, q}p, the universal polyhedron of type {p, q}p. Suppose p is even and that p and q are coprime. Then

|r(P*)| = |r(P )|3/8 Proof. Since p and q are coprime, a presentation for r(P) □ r(P5) is given by

(P0,P1,P2 | P2 = P2 = P2 = P0P1 = (P0P2)2 = P1P2 = (P0P1 P2)p = e) and direct calculation shows that this is a group of order 2. Then by Proposition 3.3, |r(P) o r(P5)| =

|r(P )|2/2.

Now we consider (r(P) o r(P5)) □ r(P5n). In this group, the order of p0p1p2 divides both p and q, and thus p0p1p2 = e. Therefore, p0p1 = p2, which forces p0p1 to have order dividing 2, and similarly P0 = P1P2, which forces p1p2 to have order dividing 2. Therefore, the comix is a (not necessarily proper) quotient of the group [2, 2]1, a group of order 4. Now, since r(P5n) = [p,p]q and p is even, we see that r(P5n) covers [2, 2]1. We similarly see that r(P) covers [2,1]1 and that r(P5) covers [1, 2]1, and thus r(P) o r(P5) covers [2,1]1 o [1, 2]1, which is equal to [2, 2]1. Thus we see that the group [2, 2]1 is the maximal group covered by both r(P) o r(P5) and r(P5n), and therefore it is their comix. Therefore,

|r(P) o r(P5) o T(V)|= |r(P' o r(P5>|-|r<P"" = iTiP)! □

We note here that the arguments used can be generalized to give bounds on |r(P*)| even when we cannot calculate the exact value. In the next section, however, we will only consider cases where we can calculate |r(P*)| exactly.

4. The Covers of Universal Polyhedra

In this section, we will consider several of the finite polyhedra P = {p, q}r and calculate |r(P*)|. The results are summarized in Table 1. In most cases, the sizes are easily calculated by applying Corollary 3.5 to P or one of its images under the duality operations. A few others can be found by applying Theorem 3.6 or by calculating the size directly using GAP [6]. We cover the remaining cases here.

Table 1. Self-dual, self-Petrie covers of finite polyhedra {p, q}r.

P \r(P )| \r(P *)\ Method

{2, 2k + 1U+2 4(2k + 1) 8(2k + 1)3 Hand

{2, 4k}4fc 16k 32k3 Hand

{2, 4k + 2}4fc+2 8(2k + 1) 8(2k + 1)3 Hand

{3,3}4 24 (24)3 Thm. 3.4

{3,4}6 48 (48)3/8 GAP

{3,5}5 60 (60)3 Thm. 3.4

{3, 5}io 120 (120)3 GAP

{3,6}6 108 (108)3/216 GAP

{3, 7}8 336 (336)6/8 Cor. 3.5

{3, 7}9 504 (504)6 Cor. 3.5

{3, 7}i3 1, 092 (1, 092)6 Cor. 3.5

{3, 7}i5 12,180 (12,180)6 Cor. 3.5

{3, 7}i6 21, 504 (21, 504)6/8 Cor. 3.5

{3,8}8 672 (672)3/8 Thm. 3.6

{3, 8}ii 12,144 (12,144)6/8 Cor. 3.5

{3,9}g 3, 420 (3, 420)3 GAP

{3, 9}io 20, 520 (20, 520)6/216 Cor. 3.5

{4,4}4fc 64k2 64k6 Hand

{4,4}4fc+2 16(2k + 1)2 32(2k + 1)6 Hand

{4,5}5 160 (160)3 Thm. 3.4

{4,5}9 6, 840 (6, 840)6/8 Cor. 3.5

We start with P = {2, 2s}. The order of P0P1P2 in r(P) is 2s, and therefore P = {2, 2s}2s, which has an automorphism group of order 8s. If s = 1, then P is already self-dual and self-Petrie. In any case, there are only 3 distinct images of P under the duality operations, and thus

P * = P o P5 o Pn

Now, P o P5 is a self-dual regular polyhedron of type {2s, 2s}2s. We note that for any s, the group r(P) □ r(P5) is equal to [2, 2]2s. In fact, this group is equal to [2,2]2, the group of order 8 generated by 3 commuting involutions (i.e., the direct product of three cyclic groups of order 2). Then by

Proposition 3.3, we see that |r(P) o r(P5)| = 8s2. In order to determine whether P o P5 is self-Petrie, we would like to determine the group r(P) o r(P5). A computation with GAP [6] suggests that the group is always the quotient of [2s, 2s] 2s by the extra relation (pip0pip2)2 = e. Since this extra relation also holds in r(P) and r(P5), this quotient must cover r(P) o r(P5). Therefore, to prove that this is in fact the mix, it suffices to show that this group has order 8s2. Start by considering the Cayley graph G of

(P0,Pi,P2 | P2 = P2 = p2 = (P0P2)2 = (P1P0P1P2)2 = e)

. Starting at a vertex and building out from it, we see that the Cayley graph of this group is the uniform tiling 4.8.8 of the plane by squares and octagons. Figure 1 gives a local picture of G.

Figure 1. Local picture of the Cayley graph G.

2 0 0 2 2 0 0 2 2 0 0 2 0

\1 \1 1 /// \1 1

2 0 0 2 2 0 0 2 2 0 0 2

/l l\ /l l\ /1 1

2 0 0 2 2 0 0 2 2 0 0 2 0

\1 \1 1 /// \1 1

2 0 0 2 2 0 0 2 2 0 0 2

/1 l\ /1 1 \ /1 1

2 0 0 2 2 0 0 2 2 0 0 2 0

\1 \1 1 /// \1 1

2 0 0 2 2 0 0 2 2 0 0 2

2 /1 l\ 2 / 1 l\ 2 / 1 1

Now, let us see what happens when we introduce the remaining relations (p0p1)2s = e and (p1p2)2s = e. We note that the components of G induced by edges labeled 0 and 1 are vertical zigzags, while the components of G induced by edges labeled 1 and 2 are horizontal zigzags. Therefore, adding the relation (p0p1)2s = e forces an identification between points that are s tiles away vertically, and adding the relation (p1p2)2s = e forces an identification between points that are s tiles away horizontally. Therefore, the Cayley graph of r(P o P5) consists of an s x s grid of tiles, with opposite sides identified. Each tile has 8 vertices, so there are a total of 8s2 vertices, which shows that the given group has 8s2 elements. Therefore the given group is indeed the mix.

Now we consider (r(P) o r(P5)) □ r(Pn), which is the quotient of [2s, 2s]2 by the extra relation (p1 p0p1p2)2 = e. Put another way, we get the quotient of r(P) o r(P5) by the extra relation (p0p1p2)2 = e.

Using the Cayley graph from before, we see that the relation (P0P1P2)2 = e forces us to identify each tile with the tiles that touch it at a corner. When s is odd, this forces every tile to be identified, leaving us with a Cayley graph with 8 vertices. When s is even, we instead get 2 distinct tiles, and the Cayley graph has 16 vertices. Therefore, |r(P) o r(P5) o r(P5n)| = 8s3 if s is odd, and 4s3 if s is even. In other words, if s = 2k + 1, then |r(P*)| = 8(2k + 1)3, and if s = 2k, then |r(P*)| = 32k3.

Now suppose that P = {2,2k + 1}. This polyhedron is covered by Q = {2,4k + 2} (which is equal to {2,4k + 2}4k+2, as we observed earlier); therefore, QoQ5 covers P o P5. Calculating the size of the mix, we find that |r(Q) o r(Q5)| = |r(P) o r(P51, and thus these two groups must be equal. From this it easily follows that Q* = P*, and thus |r(P*)| = 8(2k + 1)3.

Next we consider the polyhedra {4,4}2s, which are the torus maps {4,4}(s,s) with 16s2 flags [7]. First, suppose that s = 2k, so that P = {4,4^fc. Then r(P) □ r(Pn) = [4,4]4, which has order 64. Therefore, by Proposition 3.3,

|r(P) o r(Pn)| = |r(P)||r(Pn)|/64 = 64k4

Now, P o Pn is of type {4k, 4}4k, and Pn5 is the universal polyhedron of type {4,4k}4. Thus (r(P) o r(Pn)) □ r(Pn5) is [4,4]4 or a proper quotient. Since r(P) covers [4,4]4, so does r(P) o r(Pn). Then since r(Pn5) also covers [4,4]4, so does (r(P) o r(Pn)) □ r(Pn5), and thus the comix is the whole group [4,4]4. Thus we see that

|r(P) o r(Pn) o r(Pn5)| = |r(P) o r(Pn)| ■ |r(Pn5)|/64 = 64k6

Now suppose that s = 2k + 1, so that P = {4,4}4fc+2. Then r(P) □ r(Pn) = [2,4]2, which has size 8. Therefore,

|r(P) o r(Pn)| = |r(P)| ■ |r(Pn)|/8 = 32(2k + 1)4

Now, P o Pn is of type {8k + 4,4}8fc+4 and Pn5 is the universal polyhedron {4,4k + 2}4. Thus (r(P) o r(Pn)) □ r(Pn5) is [4, 2]4 or a proper quotient. Clearly, r(Pn5) covers [4, 2^. Furthermore, r(P) covers [4,4]2 and r(Pn) covers [2,4]4; therefore, their mix covers [4,4]2 o [2,4]4, which covers [4, 2]4. Therefore, the comix is the whole group [4, 2]4 of order 16, and we see that

|r(P) o r(Pn) o r(Pn5)| = |r(P) o r(Pn)| ■ |r(Pn5)|/16 = 32(2k + 1)6

It would be natural here to consider the torus maps {3,6}2s = {3,6}(s,0). However, in this case there are 6 distinct polyhedra under the duality operations, and the problem seems to be intractable.

Finally, we note that the self-dual, self-Petrie covers of {3, 3}4 and {3,4}6 have groups of the same order. In fact, since {3,4}6 covers {3,4}3, these two polyhedra have the same self-dual, self-Petrie cover.

References

1. Jones, G.A.; Thornton, J.S. Operations on maps, and outer automorphisms. J. Comb. Theory Ser. B 1983, 35, 93-103.

2. Coxeter, H.S.M. Regular Polytopes, 3rd ed.; Dover Publications Inc.: New York, NY, USA, 1973; pp. xiv+321.

3. McMullen, P.; Schulte, E. Abstract Regular Polytopes. In Encyclopedia of Mathematics and Its Applications; Cambridge University Press: Cambridge, MA, USA, 2002; Volume 92, pp. xiv+551.

4. Breda D'Azevedo, A.; Nedela, R. Join and intersection of hypermaps. Acta Univ. M. Belii Ser. Math. 2001, 9, 13-28.

5. Wilson, S.E. Parallel products in groups and maps. J. Algebra 1994,167, 539-546.

6. The GAP Group. GAP—Groups, Algorithms, and Programming, Version 4.4.12; The GAP Group: Glasgow, UK, 2008.

7. Coxeter, H.S.M.; Moser, W.O.J. Generators and Relations for Discrete Groups. In Ergebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas], 4th ed.; Springer-Verlag: Berlin, Heidelberg, Germany, 1980; Volume 14, pp. ix+169.

© 2012 by the author; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/.)

Copyright of Symmetry (20738994) is the property of MDPI Publishing and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use.