Computing the Symmetry Groups of the Platonic Solids with the Help of Maple
|
|
- Natalie Bishop
- 5 years ago
- Views:
Transcription
1 Computing the Symmetry Groups of the Platonic Solids with the Help of Maple June 27, 2002 In this note we will determine the symmetry groups of the Platonic solids. We will use Maple to help us do this. The five Platonic solids are the tetrahedron, the cube, the octahedron, the dodecahedron, and the icosahedron. We will view the symmetry groups of these solids as subgroups of the group of permutations of the vertices of the solid. For each of the Platonic solids, we will use a counting argument to find an upper bound for the order of the symmetry group. We will then, by intelligent trial and error, find three elements of the symmetry group and use Maple to show that the group generated by them has order exactly equal to this upper bound. By doing so, we can conclude that the upper bound is in fact equal to the order of the group, and that the group is generated by the three symmetries. In each case we will have the symmetry group G represented as G = a, b, c with a, b rotations and c a reflection. To help our counting argument, we point out that any symmetry is determined by its action on three vertices; to see this, if we center the solid at the origin, then three vertices represent three linearly independent vectors, or a basis of R 3. A symmetry fixes the center, so is a linear transformation, which is then determined by its action on a basis. Alternatively, we can use the fact that an isometry of R n is determined by its action on n + 1 points. Thus, an isometry of a Platonic solid is determined by its action on 4 points. Since the center must be sent to itself, an isometry is determined by what it does to three vertices. We will use this fact without further comment for each of the five solids. In order to determine the symmetry groups, we use a fact from the theory of group actions. If G is a group and H a subgroup, then there is a homomorphism ϕ : G Perm(G/H), 1
2 where G/H is the set of left cosets of H in G. This homomorphism is given as follows. For g G, let P g be the permutation G/H G/H given by P g (xh) = gxh. The map ϕ is then defined by ϕ(g) = P g. It is a group homomorphism and ker(ϕ) is the largest normal subgroup of G contained in H. If [G : H] = n, then Perm(G/H) = S n, so ϕ yields a homomorphism from G to S n. These facts can be found in Walker [2, Theorem ]. Maple can calculate ker(ϕ); this normal subgroup is called the core of H in G. To help understand our choice of Maple commands, we summarize our findings. We will see, without much trouble, that the symmetry group of the tetrahedron is S 4. For the cube and octahedron, the symmetry group is isomorhic to a semidirect product S 4 Z 2. The group S 4 will be obtained as the rotation subgroup R of G, but more directly it will be generated by the rotations a, b, as mentioned above. We will show that R = S 4 by producing a subgroup H of R whose core in R is 1 and with [H : R] = 4. We then get an injective map R S 4. We show that R = 24, and this then yields R = S 4. With similar methods we show that the symmetry groups of the dodecahedron and icosahedron are both isomorphic to a semidirect product of A 5 by Z 2. At the end of this note, we will investigate semidirect products of S 4 and A 5 by Z 2. A consequence of the result we prove will show that the cube and the octahedron have isomorphic symmetry groups, as do the dodecahedron and the icosahedron. In all cases we choose H to be the normalizer in R of a p-sylow subgroup of R, for an appropriate prime p. It is no coincidence that the symmetry group of the octahedron and the symmetry group of the cube are isomorphic, as are the groups for the dodecahedron and icosahedron. There is a notion of duality of Platonic solids. If you take a Platonic solid, put a point in the center of each face, and connect all these dots, you get the skeleton of another Platonic solid. The resulting solid is called the dual of the first solid. For instance, the dual of the octahedron is the cube, and the dual of the cube is the octahedron. By viewing the dual solid as being built from a solid in this way, any symmetry of the solid will yield a symmetry of the dual, and vice-versa. From this we get that the symmetry groups of a Platonic solid and its dual are isomorphic. 1 The Tetrahedron 2
3 The tetrahedron T is a solid with four faces and four vertices. We view Sym(T ) as a subgroup of S 4 by viewing the symmetries of T as permutations of the four vertices. It is clear that Sym(T ) S 4 = 24; this is the one case in which we don t use a counting argument to get an upper bound. We now show that Sym(T ) is isomorphic to S 4. Let a be the counterclockwise rotation of 120 that fixes vertex 4 and let b be the counterclockwise rotation of 120 that fixes vertex 1, and let c be the reflection that fixes vertices 1 and 4 and interchanges vertices 2 and 3. We now have Maple determine the group generated by a, b, c. > with(group): > a := [[1,2,3]]: > b := [[4,2,3]]: > c := [[1,2]]: > G := permgroup(4,{a,b,c}): > grouporder(g); 24 From the Maple output, we see that Sym(T ) = 24. Therefore, Sym(T ) = S 4. 2 The Cube The cube C has six faces and eight vertices. We view Sym(C) as a subgroup of S 8 by viewing the symmetries of C as permutations of the eight vertices of C. We use a counting argument to get an upper bound for Sym(C). First, there are eight choices of where vertex 1 can be sent. Once vertex 1 has been sent somewhere, there are three choices for where vertex 2 can be sent because there are three vertices connected to any given vertex. Finally, there are two choices for where vertex 4 can be sent since it must be sent to a vertex connected to the image of vertex 1 but not to the image of vertex 2. Thus, Sym(C) = 48. Let a be the counterclockwise rotation by 90 that fixes the top and bottom faces, let b the rotation of 90 that sends the top face to the front face, and let c be the reflection about 3
4 the plane parallel to the top and bottom faces that passes through the center of the square. We then use Maple to get the following output. > a := [[1,2,3,4],[5,6,7,8]]: > b := [[1,4,8,5],[2,3,7,6]]: > c := [[1,5],[2,6],[3,7],[4,8]]: > G := permgroup(8,{a,b,c}): > grouporder(g); > R := permgroup(8,{a,b}): > grouporder(r); > P := Sylow(R,3): > H := normalizer(r,p): > grouporder(h); > core(h,r); > d := mulperms(c,mulperms(a,c)); permgroup(8, {}) d := [[1, 2, 3, 4], [5, 6, 7, 8]] > mulperms(mulperms(b,c),mulperms(b,c)); > groupmember(d,r); [] true From this, we see that Sym(C) = 48 and {a, b} generates a subgroup R of order 24. Furthermore, since H is a subgroup of R of order 6, and since the core of H in R is trivial, we see that the homomorphism R Perm(R/H) = S 4 obtained from [2, Theorem ] is injective, and so R = S 4 since these groups have the same order. Furthermore, the Maple output shows that conjugation by c sends R to itself, but is not the identity map on R, as 4
5 one of the commands shows that (bc) 2 = 1, so cbc 1 = cbc = b 1 b. Thus, Sym(C) is a nontrivial semidirect product of S 4 and c = Z 2. 3 The Octahedron The octahedron is a solid with eight faces and six vertices. We view the symmetry group of the octahedron O as a subgroup of S 6 by viewing the symmetries of O as permutations of the six vertices. To get an upper bound for Sym(O), we note that there are six choices for where vertex 1 is sent, and once it is determined, there are four choices for where vertex 2 goes, since each vertex is connected to four other vertices. Finally, there are two choices for where vertex 5 is sent, since it must be send to a vertex connected both to the image of 1 and to the image of 2. Thus, Sym(O) = 48. Let a be the rotation of 90 that fixes the top and bottom vertices, b be the rotation of 120 that fixes the front face, and let c be the reflection about the plane containing vertices 1, 2,3, 4. We have the following Maple output. > a := [[1,2,3,4]]: > b := [[5,1,2],[6,3,4]]: > c := [[5,6]]: > G := permgroup(6,{a,b,c}): > grouporder(g); > R := permgroup(6,{a,b}): > grouporder(r); > P := Sylow(R,3): > H := normalizer(r,p): > grouporder(h);
6 6 > core(h,r); permgroup(6, {}) > d1 := mulperms(c,mulperms(a,c)); d1 := [[1, 2, 3, 4]] > d2 := mulperms(c,mulperms(b,c)); d2 := [[1, 2, 6], [3, 4, 5]] > groupmember(d1,r); true > groupmember(d2,r); true From the output, we get Sym(O) = 48 and that the group R generated by a and b has order 24. As in the case with the cube, we conclude that Sym(O) is a nontrivial semidirect product of S 4 and Z 2. 4 The Dodecahedron The dodecahedron D has twelve faces and twenty vertices. We view the symmetries of D as permutations of the twenty vertices. To get an upper bound for Sym(D), we note that vertex 1 can be sent to any of the twenty vertices. Once vertex 1 is determined, vertex 2 must be sent to one of three vertices since each vertex is connected to three others. Finally, 6
7 there are two choices for where vertex 6 is sent since it must go to a vertex connected to the image of vertex 1. Thus, Sym(D) = 120. Let a be the rotation of 72 that fixes the top and bottom faces, let b the rotation of 72 sends vertex 1 to 6 and vertex 6 to vertex 7. Finally, let c be the reflection about the plane containing vertices 1, 6, 11, and 18. We have the following Maple output. > a := [[1,2,3,4,5],[6,8,10,12,14],[7,9,11,13,15],[16,17,18,19,20]]: > b := [[1,6,7,8,2],[3,5,15,16,9],[4,14,20,17,10],[12,13,19,18,11]]: > c := [[2,5],[3,4],[7,15],[8,14],[9,13],[10,12],[16,20],[17,19]]: > G := permgroup(20,{a,b,c}): > grouporder(g); > R := permgroup(20,{a,b}): > grouporder(r); > P := Sylow(R,2): > H := normalizer(r,p): > grouporder(h); > core(h,r); > H2 := normalizer(g,p): > grouporder(h2); > grouporder(core(h2,g)); permgroup(20, {}) > mulperms(mulperms(a,c),mulperms(a,c)); 24 2 [] 7
8 > d:=mulperms(c,mulperms(b,c)); d := [[1, 6, 15, 14, 5], [2, 7, 20, 13, 4], [3, 8, 16, 19, 12], [9, 17, 18, 11, 10]] > groupmember(d,r); true We conclude that Sym(D) = 120 and that the subgroup R generated by a, b has order 60. Since H is a subgroup of R of order 12, and the core of H in R is trivial, we have an injective homomorphism R S 5. The only subgroup of S 5 of order 60 is A 5. Thus, R = A 5. Moreover, G is not isomorphic to S 5 since we see that if H 2 = N G (P ), then the core of H 2 in G is nontrivial. However, the only nontrivial normal subgroup of S 5 is A 5 ; we thus conclude that G S 5. However, we see that Sym(D) is a nontrivial semidirect product of A 5 and Z 2. 5 The Icosahedron The icosahedron I has twenty faces and twelve vertices. Let a be the rotation of 72 that fixes the top and bottom vertices, and let b be the rotation that permutes vertices 1, 2, 6. Also, let c be the reflection across the plane containing vertices 6 and 12, along with 4 and 7. > a := [[1,2,3,4,5],[7,8,9,10,11]]: > b := [[6,1,2],[3,5,7],[4,11,8],[9,10,12]]: > c := [[1,2],[3,5],[8,11],[9,10]]: > G := permgroup(12,{a,b,c}): > grouporder(g); > R := permgroup(12,{a,b}): > grouporder(r); 120 8
9 60 > P := Sylow(R,2): > H := normalizer(r,p): > grouporder(h); 12 > core(h,r); permgroup(12, {}) > mulperms(mulperms(a,c),mulperms(a,c)); [] > mulperms(mulperms(b,c),mulperms(b,c)); [] From the output we have the same conclusion as for the dodecahedron; the group R is isomorphic to A 5, and Sym(I) is a semidirect product of A 5 and Z 2. 6 Semidirect Products of N by Z 2 We have described symmetry groups of the Platonic solids in terms of semidirect products. It would appear that we have not completely determined them. For example, the symmetry group of the cube and octahedron are both semidirect products of S 4 by Z 2. Recall that if ϕ : H Aut(N) is a group homomorphism, then the semidirect product N ϕ H of N by H (determined by ϕ) is the set N H with multiplication given by (n, h)(n, h ) = (nϕ(h)(n ), hh ). We note that the isomorphism class of N ϕ H depends on the map ϕ. As an example, consider S n, which contains the normal subgroup A 5 of order 2. View Z 2 = [1, 2] S n. By the relation between internal and external semidirect products, we see that S n = An [1,2] Z 2. To simplify notation, if ϕ : Z 2 Aut(G), and if σ = ϕ(1), we write G σ Z 2 for G ϕ Z 2. Moreover, if σ = Int(u), we further simplify notation and write G u Z 2. Note that if σ = Int(u), then σ 2 = ϕ(1 + 1) = id, so u 2 Z(G). Since Z(S 4 ) and Z(A 5 ) are both trivial, any such u satisfies u 2 = e. We claim that, for any two nontrivial homomorphisms ϕ 1, ϕ 2 : Z 2 Aut(S 4 ), we have S 4 ϕ1 Z 2 = S4 ϕ2 Z 2. To verify this, we first recall that Sym(S 4 ) = S 4 ; this follows since every automorphism of S 4 is inner and Z(S 4 ) = e. Furthermore, every automorphism of A 5 9
10 is of the form Int(u) for some u S 5. These facts about the automorphism groups can be found in Section 3.2 of [1]. If u S 5 and σ = Int(u) A5, we write A 5 u Z 2 for A 5 σ Z 2. We note that if u A 5, then Int(u) A5 is an inner automorphism of A 5, while if u S 5 A 5, then it is not inner. Proposition If u, v S 4 have order 2, then S 4 u Z 2 = S4 v Z 2. Therefore, any two nontrivial semidirect products of S 4 by Z 2 are isomorphic, and are isomorphic to the symmetry groups of the cube and of the octahedron. 2. If u, v A 5 have order 2, then A 5 u Z 2 = A5 v Z 2 = Sym(D) = Sym(I). If u, v S 5 A 5, then A 5 u Z 2 = A5 v Z 2 = S5, and S 5 is not isomorphic to these symmetry groups. Proof. To prove (1), a short calculation shows that (e, 1)(g, 0)(e, 1) 1 = (e, 1)(g, 0)(e, 1) = (ugu, 0) in S 4 u Z 2. By some experimentation, one finds that (vu, 1)(g, 0)(vu, 1) 1 = (vu, 1)(g, 0)(vu, 1) = (vgv, 0). We define a map f : S 4 v Z 2 S 4 u Z 2 by f(g, 0) = (g, 0) and f(e, 1) = (vu, 1). In order for this to be a group homomorphism, we note that (g, 1) = (g, 0)(e, 1). Thus, we set f(g, 1) = (gvu, 1). A short check shows that f is indeed a bijective group homomorphism, which proves (1). A similar calculation shows that A 5 u Z 2 = A5 v Z 2 when u, v A 5 or u, v S 5 A 5. Note that in either of these cases, vu A 5, so the argument for (1) works in this case. Thus, there are at most two nonisomorphic (nontrivial) semidirect products of A 5 by Z 2 since [S 5 : A 5 ] = 2. We know that S 5 is one, and that S 5 = A 5 [1,2] Z 2. By our Maple calculations, Sym(D) and Sym(I) both contain a normal subgroup of order 2. Thus, they must both be isomorphic to A 5 u Z 2 for u A 5. By the way, if u A 5, we can see directly that A 5 u Z 2 has a normal subgroup of order 2, since if N = (u, 1), then (g, 0)(u, 1)(g, 0) 1 = (g, 0)(u, 1)(g 1, 0) = (gu, 1)(g 1, 0) = (gu ug 1 u, 1) = (u, 1) and (e, 1)(u, 1)(e, 1) 1 = (e, 1)(u, 1)(e, 1) = (u, 0)(e, 1) = (u, 1). Thus, N is indeed a normal subgroup of A 5 u Z 2 of order 2. References [1] M. Suzuki, Group Theory I, Springer-Verlag, Berlin, [2] E. Walker, Introduction to Abstract Algebra. 10
Computing the Symmetry Groups of the Platonic Solids with the Help of Maple
Computing the Symmetry Groups of the Platonic Solids with the Help of Maple In this note we will determine the symmetry groups of the Platonic solids. We will use Maple to help us do this. The five Platonic
More informationON THE GROUP-THEORETIC PROPERTIES OF THE AUTOMORPHISM GROUPS OF VARIOUS GRAPHS
ON THE GROUP-THEORETIC PROPERTIES OF THE AUTOMORPHISM GROUPS OF VARIOUS GRAPHS CHARLES HOMANS Abstract. In this paper we provide an introduction to the properties of one important connection between the
More informationINTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with
More informationMath 462: Review questions
Math 462: Review questions Paul Hacking 4/22/10 (1) What is the angle between two interior diagonals of a cube joining opposite vertices? [Hint: It is probably quickest to use a description of the cube
More informationThe University of Sydney MATH2008 Introduction to Modern Algebra
2 Semester 2, 2003 The University of Sydney MATH2008 Introduction to Modern Algebra (http://www.maths.usyd.edu.au/u/ug/im/math2008/) Lecturer: R. Howlett Computer Tutorial 2 This tutorial explores the
More informationIsomorphisms. Sasha Patotski. Cornell University November 23, 2015
Isomorphisms Sasha Patotski Cornell University ap744@cornell.edu November 23, 2015 Sasha Patotski (Cornell University) Isomorphisms November 23, 2015 1 / 5 Last time Definition If G, H are groups, a map
More information1 Appendix to notes 2, on Hyperbolic geometry:
1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,
More informationConway s Tiling Groups
Conway s Tiling Groups Elissa Ross Department of Mathematics University of British Columbia, BC, Canada elissa@math.ubc.ca December 12, 2004 Abstract In this paper I discuss a method of John Conway for
More informationStructure in Quaternions Corresponding to the 4-Dimensional Tetrahedron
Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron AJ Friend School of Mathematics Georgia Institute of Technology Atlanta, GA Advised by: Adrian Ocneanu Department of Mathematics
More informationFive Platonic Solids: Three Proofs
Five Platonic Solids: Three Proofs Vincent J. Matsko IMSA, Dodecahedron Day Workshop 18 November 2011 Convex Polygons convex polygons nonconvex polygons Euler s Formula If V denotes the number of vertices
More informationEquipartite polytopes and graphs
Equipartite polytopes and graphs Branko Grünbaum Tomáš Kaiser Daniel Král Moshe Rosenfeld Abstract A graph G of even order is weakly equipartite if for any partition of its vertex set into subsets V 1
More informationAbstract Construction Projects and the Imagination
Abstract Construction Projects and the Imagination Hands-on projects for understanding abstract mathematical concepts through the use of polyhedral models and planar designs The 3-dimensional projects
More informationEquipartite polytopes and graphs
Equipartite polytopes and graphs Branko Grünbaum Tomáš Kaiser Daniel Král Moshe Rosenfeld Abstract A graph G of even order is weakly equipartite if for any partition of its vertex set into subsets V 1
More informationMa/CS 6b Class 9: Euler s Formula
Ma/CS 6b Class 9: Euler s Formula By Adam Sheffer Recall: Plane Graphs A plane graph is a drawing of a graph in the plane such that the edges are noncrossing curves. 1 Recall: Planar Graphs The drawing
More informationAn Investigation of Closed Geodesics on Regular Polyhedra
An Investigation of Closed Geodesics on Regular Polyhedra Tony Scoles Southern Illinois University Edwardsville May 13, 2008 1 Introduction This paper was undertaken to examine, in detail, results from
More informationGENERALIZED CPR-GRAPHS AND APPLICATIONS
Volume 5, Number 2, Pages 76 105 ISSN 1715-0868 GENERALIZED CPR-GRAPHS AND APPLICATIONS DANIEL PELLICER AND ASIA IVIĆ WEISS Abstract. We give conditions for oriented labeled graphs that must be satisfied
More informationLecture 4: Bipartite graphs and planarity
Lecture 4: Bipartite graphs and planarity Anders Johansson 2011-10-22 lör Outline Bipartite graphs A graph G is bipartite with bipartition V1, V2 if V = V1 V2 and all edges ij E has one end in V1 and V2.
More informationLecture 5: Dual graphs and algebraic duality
Lecture 5: Dual graphs and algebraic duality Anders Johansson 2011-10-22 lör Outline Eulers formula Dual graphs Algebraic duality Eulers formula Thm: For every plane map (V, E, F ) we have V E + F = 2
More informationMathematics As A Liberal Art
Math 105 Fall 2015 BY: 2015 Ron Buckmire Mathematics As A Liberal Art Class 26: Friday November 13 Fowler 302 MWF 10:40am- 11:35am http://sites.oxy.edu/ron/math/105/15/ Euclid, Geometry and the Platonic
More informationPÓLYA S THEORY OF COUNTING
PÓLYA S THEORY OF COUNTING MANJIL P. SAIKIA Abstract. In this report, we shall study Pólya s Theory of Counting and apply it to solve some questions related to rotations of the platonic solids. Key Words:
More informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationPlatonic Solids. Jennie Sköld. January 21, Karlstad University. Symmetries: Groups Algebras and Tensor Calculus FYAD08
Platonic Solids Jennie Sköld January 21, 2015 Symmetries: Groups Algebras and Tensor Calculus FYAD08 Karlstad University 1 Contents 1 What are Platonic Solids? 3 2 Symmetries in 3-Space 5 2.1 Isometries
More informationON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.
ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of
More informationEuler Characteristic
Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f
More informationDiscovering 5-Valent Semi-Symmetric Graphs
Discovering 5-Valent Semi-Symmetric Graphs Berkeley Churchill NSF REU in Mathematics Northern Arizona University Flagstaff, AZ 86011 July 27, 2011 Groups and Graphs Graphs are taken to be simple (no loops,
More information(d) If the moon shares nothing and the sun does not share our works, then the earth is alive with creeping men.
Math 15 - Spring 17 Chapters 1 and 2 Test Solutions 1. Consider the declaratives statements, P : The moon shares nothing. Q: It is the sun that shares our works. R: The earth is alive with creeping men.
More informationPlatonic Solids and the Euler Characteristic
Platonic Solids and the Euler Characteristic Keith Jones Sanford Society, SUNY Oneonta September 2013 What is a Platonic Solid? A Platonic Solid is a 3-dimensional object with flat faces and straight edges
More informationREU 2006 Discrete Math Lecture 5
REU 2006 Discrete Math Lecture 5 Instructor: László Babai Scribe: Megan Guichard Editors: Duru Türkoğlu and Megan Guichard June 30, 2006. Last updated July 3, 2006 at 11:30pm. 1 Review Recall the definitions
More informationResearches on polyhedra, Part I A.-L. Cauchy
Researches on polyhedra, Part I A.-L. Cauchy Translated into English by Guy Inchbald, 2006 from the original: A.-L. Cauchy, Recherches sur les polyèdres. Première partie, Journal de l École Polytechnique,
More informationUnit I: Euler's Formula (and applications).
Unit I: Euler's Formula (and applications). We define a roadmap to be a nonempty finite collection of possibly curvedlil1e segments in a piane, each with exactly two endpoints, such that if any pair of
More informationEXPLORATIONS ON THE DIMENSION OF A GRAPH
EXPLORATIONS ON THE DIMENSION OF A GRAPH RYAN KAVANAGH Abstract. Erdős, Harary and Tutte first defined the dimension of a graph G as the minimum number n such that G can be embedded into the Euclidean
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More information7th Bay Area Mathematical Olympiad
7th Bay Area Mathematical Olympiad February 22, 2005 Problems and Solutions 1 An integer is called formidable if it can be written as a sum of distinct powers of 4, and successful if it can be written
More information1 The Platonic Solids
1 The We take the celebration of Dodecahedron Day as an opportunity embark on a discussion of perhaps the best-known and most celebrated of all polyhedra the Platonic solids. Before doing so, however,
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week Eight Problems 1. Diagrams of all the distinct non-isomorphic trees on 6 or fewer vertices are listed in the lecture notes. Extend this list by drawing all
More informationarxiv: v1 [math.co] 7 Oct 2012
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 REGULAR POLYGONAL COMPLEXES IN SPACE, II DANIEL PELLICER AND EGON SCHULTE arxiv:1210.2061v1 [math.co]
More informationON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.
ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of
More informationARTIN S THEOREM: FOR THE STUDENT SEMINAR
ARTIN S THEOREM: FOR THE STUDENT SEMINAR VIPUL NAIK Abstract. This is a write-up of Artin s theorem for the student seminar in the course on Representation Theory of Finite Groups. Much of the material
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationJames Mahoney Dissertation Adviser: Dr. John Caughman Portland State University
James Mahoney Dissertation Adviser: Dr. John Caughman Portland State University 5-5-2016 Acknowledgements Dr. John Caughman, Chair Committee members: Dr. Nirupama Bulusu Dr. Derek Garton Dr. Paul Latiolais
More informationREGULAR TILINGS. Hints: There are only three regular tilings.
REGULAR TILINGS Description: A regular tiling is a tiling of the plane consisting of multiple copies of a single regular polygon, meeting edge to edge. How many can you construct? Comments: While these
More informationRegular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes
Regular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes Flags A flag is a sequence (f 1, f 0,..., f n ) of faces f i of a polytope f n, each incident with the next, with precisely
More informationVertex-Transitive Polyhedra of Higher Genus, I
Vertex-Transitive Polyhedra of Higher Genus, I Undine Leopold arxiv:1502.07497v1 [math.mg] 26 Feb 2015 Since Grünbaum and Shephard s investigation of self-intersection-free polyhedra with positive genus
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationMissouri State University REU, 2013
G. Hinkle 1 C. Robichaux 2 3 1 Department of Mathematics Rice University 2 Department of Mathematics Louisiana State University 3 Department of Mathematics Missouri State University Missouri State University
More informationConstructing self-dual chiral polytopes
Constructing self-dual chiral polytopes Gabe Cunningham Northeastern University, Boston, MA October 25, 2011 Definition of an abstract polytope Let P be a ranked poset, whose elements we call faces. Then
More informationTiling of Sphere by Congruent Pentagons
Tiling of Sphere by Congruent Pentagons Min Yan September 9, 2017 webpage for further reading: http://www.math.ust.hk/ mamyan/research/urop.shtml We consider tilings of the sphere by congruent pentagons.
More informationCayley graphs and coset diagrams/1
1 Introduction Cayley graphs and coset diagrams Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X, written Cay(G, X) has two different definitions in the literature.
More informationPoint groups in solid state physics I: point group O h
American Journal of Modern Physics 2013; 2(2): 81-87 Published online March 10, 2013 (http://www.sciencepublishinggroup.com/j/ajmp) doi: 10.11648/j.ajmp.20130202.19 Point groups in solid state physics
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationQuestion. Why is the third shape not convex?
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationThe Edge Slide Graph of the 3-cube
Rose-Hulman Undergraduate Mathematics Journal Volume 12 Issue 2 Article 6 The Edge Slide Graph of the 3-cube Lyndal Henden Massey University, Palmerston North, New Zealand, lyndal_henden@hotmail.com Follow
More informationAlgebra II: Review Exercises
: Review Exercises These notes reflect material from our text, A First Course in Abstract Algebra, Seventh Edition, by John B. Fraleigh, published by Addison-Wesley, 2003. Chapter 7. Advanced Group Theory
More informationInstructor: Padraic Bartlett. Lecture 2: Schreier Diagrams
Algebraic GT Instructor: Padraic Bartlett Lecture 2: Schreier Diagrams Week 5 Mathcamp 2014 This class s lecture continues last s class s discussion of the interplay between groups and graphs. In specific,
More informationDIHEDRAL GROUPS KEITH CONRAD
DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 of the plane preserving a regular n-gon, with the operation being composition. These polygons
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationLecture 19: Introduction To Topology
Chris Tralie, Duke University 3/24/2016 Announcements Group Assignment 2 Due Wednesday 3/30 First project milestone Friday 4/8/2016 Welcome to unit 3! Table of Contents The Euler Characteristic Spherical
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More informationGenerating Functions for Hyperbolic Plane Tessellations
Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints
More informationRegular Polyhedra of Index Two, I
Regular Polyhedra of Index Two, I Anthony M. Cutler Northeastern University Boston, MA 02115, USA arxiv:1005.4911v1 [math.mg] 26 May 2010 and Egon Schulte Northeastern University Boston, MA 02115, USA
More informationTHE CLASSIFICATION OF FOOTBALL PATTERNS
THE CLASSIFICATION OF FOOTBALL PATTERNS V. BRAUNGARDT AND D. KOTSCHICK ABSTRACT. We prove that every spherical football is a branched cover, branched only in the vertices, of the standard football made
More informationPlatonic Polyhedra and How to Construct Them
Platonic Polyhedra and How to Construct Them Tarun Biswas June 17, 2016 The platonic polyhedra (or platonic solids) are convex regular polyhedra that have identical regular polygons as faces They are characterized
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationAUTOMORPHISMS OF THE GRAPH OF FREE SPLITTINGS
AUTOMORPHISMS OF THE GRAPH OF FREE SPLITTINGS JAVIER ARAMAYONA & JUAN SOUTO Abstract. We prove that every simplicial automorphism of the free splitting graph of a free group F n is induced by an outer
More informationCOVERING SPACES, GRAPHS, AND GROUPS
COVERING SPACES, GRAPHS, AND GROUPS CARSON COLLINS Abstract. We introduce the theory of covering spaces, with emphasis on explaining the Galois correspondence of covering spaces and the deck transformation
More informationTwo-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014
Two-graphs revisited Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014 History The icosahedron has six diagonals, any two making the same angle (arccos(1/
More informationPortraits of Groups on Bordered Surfaces
Bridges Finland Conference Proceedings Portraits of Groups on Bordered Surfaces Jay Zimmerman Mathematics Department Towson University 8000 York Road Towson, MD 21252, USA E-mail: jzimmerman@towson.edu
More informationOne simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.
Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of
More informationEndomorphisms and synchronization, 2: Graphs and transformation monoids
Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras Given a relational structure R, there are several similar ways to produce
More informationOn a Triply Periodic Polyhedral Surface Whose Vertices are Weierstrass Points
Arnold Math J. DOI 10.1007/s40598-017-0067-9 RESEARCH CONTRIBUTION On a Triply Periodic Polyhedral Surface Whose Vertices are Weierstrass Points Dami Lee 1 Received: 3 May 2016 / Revised: 12 March 2017
More informationPolyhedra. Kavitha d/o Krishnan
Polyhedra Kavitha d/o Krishnan Supervisor: Associate Professor Helmer Aslaksen Department of Mathematics National University of Singapore Semester I 2001/2002 Abstract Introduction The report focuses on
More informationON THE PACKING CHROMATIC NUMBER OF SEMIREGULAR POLYHEDRA
Acta Electrotechnica et Informatica, Vol., No., 0, 7, DOI: 0.478/v098-0-007-7 ON THE PACKING CHROMATIC NUMBER OF SEMIREGULAR POLYHEDRA Marián KLEŠČ, Štefan SCHRÖTTER Department of Mathematics and Theoretical
More informationMedial symmetry type graphs
Medial symmetry type graphs Isabel Hubard Instituto de Matemáticas Universidad Nacional Autónoma de México México hubard@matem.unam.mx María del Río Francos Alen Orbanić Tomaž Pisanski Faculty of Mathematics,
More informationColor Models as Tools in Teaching Mathematics
Color Models as Tools in Teaching Mathematics Ma. Louise Antonette N. De Las Peñas mlp@math.admu.edu.ph Department of Mathematics, Ateneo de Manila University Philippines Abstract: In this paper we discuss
More informationComponent Connectivity of Generalized Petersen Graphs
March 11, 01 International Journal of Computer Mathematics FeHa0 11 01 To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized
More informationA DESCRIPTION OF THE OUTER AUTOMORPHISM OF S 6, AND THE INVARIANTS OF SIX POINTS IN PROJECTIVE SPACE
A DESCRIPTION OF THE OUTER AUTOMORPHISM OF S 6, AND THE INVARIANTS OF SIX POINTS IN PROJECTIVE SPACE BEN HOWARD, JOHN MILLSON, ANDREW SNOWDEN, AND RAVI VAKIL ABSTRACT. We use a simple description of the
More informationTHE PLATONIC SOLIDS BOOK DAN RADIN
THE PLATONIC SOLIDS BOOK DAN RADIN Copyright 2008 by Daniel R. Radin All rights reserved. Published by CreateSpace Publishing 3-D renderings were created on a thirteen-year-old Macintosh computer using
More informationTomáš Madaras and Pavol Široczki
Opuscula Math. 34, no. 1 (014), 13 138 http://dx.doi.org/10.7494/opmath.014.34.1.13 Opuscula Mathematica ON THE DIMENSION OF ARCHIMEDEAN SOLIDS Tomáš Madaras and Pavol Široczki Communicated by Mariusz
More informationor else take their intersection. Now define
Samuel Lee Algebraic Topology Homework #5 May 10, 2016 Problem 1: ( 1.3: #3). Let p : X X be a covering space with p 1 (x) finite and nonempty for all x X. Show that X is compact Hausdorff if and only
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationCombinatorial constructions of hyperbolic and Einstein four-manifolds
Combinatorial constructions of hyperbolic and Einstein four-manifolds Bruno Martelli (joint with Alexander Kolpakov) February 28, 2014 Bruno Martelli Constructions of hyperbolic four-manifolds February
More informationPoint-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS
Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following
More informationVertex-transitive direct products of graphs
Vertex-transitive direct products of graphs Richard H. Hammack Department of Mathematics Virginia Commonwealth University Richmond, Virginia U.S.A. rhammack@vcu.edu Wilfried Imrich Dept. of Mathematics
More informationOn Maximal Homogeneous 3-Geometries A Polyhedron Algorithm for Space Tilings
universe Article On Maximal Homogeneous 3-Geometries A Polyhedron Algorithm for Space Tilings István Prok Department of Geometry, Institute of Mathematics, Budapest University of Technology and Economics;
More informationTilings of the Euclidean plane
Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.
More informationExample: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices:
11.1: Space Figures and Cross Sections Polyhedron: solid that is bounded by polygons Faces: polygons that enclose a polyhedron Edge: line segment that faces meet and form Vertex: point or corner where
More informationREGULAR POLYTOPES REALIZED OVER Q
REGULAR POLYTOPES REALIZED OVER Q TREVOR HYDE A regular polytope is a d-dimensional generalization of a regular polygon and a Platonic solid. Roughly, they are convex geometric objects with maximal rotational
More informationLecture 11 COVERING SPACES
Lecture 11 COVERING SPACES A covering space (or covering) is not a space, but a mapping of spaces (usually manifolds) which, locally, is a homeomorphism, but globally may be quite complicated. The simplest
More informationpα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD
6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD of π 1 (M 2 )onπ 1 (M 4 ) by conjugation. π 1 (M 4 ) has a trivial center, so in other words the action of π 1 (M 4 ) on itself is effective.
More informationFace two-colourable triangulations of K 13
Face two-colourable triangulations of K 13 M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department of Mathematics
More informationDIHEDRAL GROUPS KEITH CONRAD
DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 taking a regular n-gon back to itself, with the operation being composition. These polygons
More informationResolutions of the pair design, or 1-factorisations of complete graphs. 1 Introduction. 2 Further constructions
Resolutions of the pair design, or 1-factorisations of complete graphs 1 Introduction A resolution of a block design is a partition of the blocks of the design into parallel classes, each of which forms
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationWeek 9: Planar and non-planar graphs. 7 and 9 November, 2018
(1/27) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/ niall/ma284/ 7 and 9 November, 2018 1 Planar graphs and Euler s formula 2 Non-planar graphs K 5 K
More informationBraid groups and Curvature Talk 2: The Pieces
Braid groups and Curvature Talk 2: The Pieces Jon McCammond UC Santa Barbara Regensburg, Germany Sept 2017 Rotations in Regensburg Subsets, Subdisks and Rotations Recall: for each A [n] of size k > 1 with
More informationExplore Solids
1212.1 Explore Solids Surface Area and Volume of Solids 12.2 Surface Area of Prisms and Cylinders 12.3 Surface Area of Pyramids and Cones 12.4 Volume of Prisms and Cylinders 12.5 Volume of Pyramids and
More informationApollonian ring packings
Apollonian ring packings Dedicated to Ron Graham Adrian Bolt Steve Butler Espen Hovland Abstract Apollonian packings are a well-known object in mathematics formed by starting with a set of three mutually
More information11.4 Three-Dimensional Figures
11. Three-Dimensional Figures Essential Question What is the relationship between the numbers of vertices V, edges E, and faces F of a polyhedron? A polyhedron is a solid that is bounded by polygons, called
More information