Computing the Symmetry Groups of the Platonic Solids with the Help of Maple
|
|
- Dominick Jacobs
- 5 years ago
- Views:
Transcription
1 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 solids are the tetrahedron, the cube, the octahedron, the dodecahedron, and the icosahedron. We will view the symmetry groups of these solids in two ways. By definition, the symmetry group of a solid is the set of isometries of R 3 that stabilize the set. In each of these five cases we may view the solid as being centered at the origin. The center of each must be fixed by any symmetry. Thus, the symmetry group is then a subgroup of the group of linear isometries, which is the orthogonal group O 3 (R) of linear transformations that preserve dot products. A second interpretation of the symmetry groups is that the group is a subgroup of the group of permutations of the vertices of the solid. We may view O 3 (R) as the group of matrices { A Gl 3 (R) :A T A = I }. Then SO 3 (R) ={A O 3 (R) :det(a) =1} is a subgroup of index 2, and it coincides with the group of rotations of R 3. If z : R 3 R 3 is defined by z(x) = x for all x R 3,then z is a reflection, z is central in O 3 (R), and O 3 (R) =SO 3 (R) z = SO 3 (R) Z 2. The element z is a symmetry of all the Platonic solids except for the Tetrahedron. Thus, it will be sufficient for the remaining four solids to determine the rotation subgroup. 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 1
2 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), where G/H is the set of left cosets of H in G. This homomorphism is given as follows. For g G, letp 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(ϕ) isthelargest 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 [1, 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.Forthecube and octahedron, the symmetry group is isomorphic to the direct 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 the direct product A 5 Z 2.InallcaseswechooseH 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. To fix notation, in each case we write G for the symmetry group of the given solid and R for the subgroup of rotations. 2
3 1 The Tetrahedron The tetrahedron T is a solid with four faces and four vertices. We view G as a subgroup of S 4 by viewing the symmetries of T as permutations of the four vertices. It is clear that G 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 G is isomorphic to S 4.Leta 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}): 24 From the Maple output, we see that G = 24. Therefore, G = S 4. 2 The Cube The cube C has six faces and eight vertices. We view G as a subgroup of S 8 by viewing the symmetries of C as permutations of the eight vertices of C. Weuseacountingargument to get an upper bound for G. First, there are eight choices of where vertex 1 can be sent. 3
4 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, G = 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 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}): > R := permgroup(8,{a,b}): > grouporder(r); > P := Sylow(R,3): > H := normalizer(r,p): > grouporder(h); > core(h,r); > center(g); permgroup(8, {}) permgroup(12, {[[1, 9], [2, 10], [3, 11], [4, 7], [5, 8], [6, 12]]}) From this, we see that G =48and{a, b} generates the rotation subgroup R, which then has 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 [1, Theorem ] is injective, and so R = S 4 since these groups have the same order. We pointed out in the introduction that if R is the rotation subgroup of the symmetry group G, then G = R Z 2.Thus,G = S 4 Z 2. 4
5 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 G, 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, G = 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}): > R := permgroup(6,{a,b}): > grouporder(r); > P := Sylow(R,3): > H := normalizer(r,p): > grouporder(h); > core(h,r); permgroup(6, {}) 5
6 > center(g); permgroup(6, {[[1, 3], [2, 4], [5, 6]]}) From the output, we get G = 48 and that the rotation subgroup R is generated by a and b and has order 24. As in the case with the cube, we conclude that G is the direct product S 4 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 G, 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, 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, G = 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}): > R := permgroup(20,{a,b}): > grouporder(r);
7 > P := Sylow(R,2): > H := normalizer(r,p): > grouporder(h); 12 > core(h,r); permgroup(20, {}) > grouporder(center(g)); 2 We conclude that G = 120 and that the rotation subgroup R is generated by a, b and 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. As we mentioned earlier, G = R Z 2,soG = A 5 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}): 120 7
8 > R := permgroup(12,{a,b}): > grouporder(r); 60 > P := Sylow(R,2): > H := normalizer(r,p): > grouporder(h); 12 > core(h,r); permgroup(12, {}) > grouporder(center(g)); 2 From the output we have the same conclusion as for the dodecahedron; the group R is isomorphic to A 5,andG is the direct product A 5 Z 2. References [1] E. Walker, Introduction to Abstract Algebra. 8
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 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.
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationThe Construction of Uniform Polyhedron with the aid of GeoGebra
The Construction of Uniform Polyhedron with the aid of GeoGebra JiangPing QiuFaWen 71692686@qq.com 3009827@qq.com gifted Department High-school northeast yucai school northeast yucai school 110179 110179
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 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 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 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 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 informationSkeletal Geometric Complexes and Their Symmetries
Skeletal Geometric Complexes and Their Symmetries arxiv:1610.02619v1 [math.mg] 9 Oct 2016 Egon Schulte Department of Mathematics Northeastern University, Boston, MA 02115, USA and Asia Ivić Weiss Department
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 informationTomaz Pisanski, University of Ljubljana, Slovenia. Thomas W. Tucker, Colgate University. Arjana Zitnik, University of Ljubljana, Slovenia
Eulerian Embeddings of Graphs Tomaz Pisanski, University of Ljubljana, Slovenia Thomas W. Tucker, Colgate University Arjana Zitnik, University of Ljubljana, Slovenia Abstract A straight-ahead walk in an
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 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 informationThe exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris
The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris J ai commencé a regarder M 0,5 à des moments perdus, c est un véritable joyau, d une géométrie très riche étroitement
More informationSHAPE AND STRUCTURE. Shape and Structure. An explanation of Mathematical terminology
Shape and Structure An explanation of Mathematical terminology 2005 1 POINT A dot Dots join to make lines LINE A line is 1 dimensional (length) A line is a series of points touching each other and extending
More informationCERTAIN FORMS OF THE ICOSAHEDRON AND A METHOD FOR DERIVING AND DESIGNATING HIGHER POLYHEDRA. North High School, Worcester, Massachusetts,
CERTAIN FORMS OF THE ICOSAHEDRON AND A METHOD FOR DERIVING AND DESIGNATING HIGHER POLYHEDRA BY ALBERT HARRY WHEELER, North High School, Worcester, Massachusetts, U.S.A. The Five Regular Solids have afforded
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 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 informationMap-colouring with Polydron
Map-colouring with Polydron The 4 Colour Map Theorem says that you never need more than 4 colours to colour a map so that regions with the same colour don t touch. You have to count the region round the
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 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 informationTriangles and Squares David Eppstein, ICS Theory Group, April 20, 2001
Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Which unit-side-length convex polygons can be formed by packing together unit squares and unit equilateral triangles? For instance
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 informationEuler Characteristic
Euler Characteristic Face Classification set_view(gl_render); set_scene(gl_render); glgetdoublev(gl_modelview_matrix, modelview_matrix1); glgetdoublev(gl_projection_matrix, projection_matrix1); glgetintegerv(gl_viewport,
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 informationGlossary of dictionary terms in the AP geometry units
Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]
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 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 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 informationH.Geometry Chapter 7 Definition Sheet
Section 7.1 (Part 1) Definition of: - A mapping of points in a figure to points in a resulting figure - Manipulating an original figure to get a new figure - The original figure - The resulting figure
More informationDate: Wednesday, 18 January :00AM. Location: Barnard's Inn Hall
Wallpaper Patterns and Buckyballs Transcript Date: Wednesday, 18 January 2006-12:00AM Location: Barnard's Inn Hall WALLPAPER PATTERNS AND BUCKYBALLS Professor Robin Wilson My lectures this term will be
More informationMath 311. Polyhedra Name: A Candel CSUN Math
1. A polygon may be described as a finite region of the plane enclosed by a finite number of segments, arranged in such a way that (a) exactly two segments meets at every vertex, and (b) it is possible
More informationThe Volume of a Platonic Solid
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-007 The Volume of a Platonic Solid Cindy Steinkruger
More informationA Physical Proof for Five and Only Five Regular Solids
A Physical Proof for Five and Only Five Regular Solids Robert McDermott Center for High Performance Computing University of Utah Salt Lake City, Utah, 84112, USA E-mail: mcdermott@chpc.utah.edu Abstract
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 informationREGULAR POLYHEDRA OF INDEX 2
REGULAR POLYHEDRA OF INDEX 2 A dissertation presented by Anthony Cutler to The Department of Mathematics In partial fulfillment of the requirements for the degree of Doctor of Philosophy in the field of
More informationPlanar Graphs, Solids, and Surfaces. Planar Graphs 1/28
Planar Graphs, Solids, and Surfaces Planar Graphs 1/28 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a
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 informationEdge Unfoldings of Platonic Solids Never Overlap
Edge Unfoldings of Platonic Solids Never Overlap Takashi Horiyama (Saitama Univ.) joint work with Wataru Shoji 1 Unfolding Simple polygon unfolded by cutting along the surface of a polyhedron Two kinds
More informationCARDSTOCK MODELING Math Manipulative Kit. Student Activity Book
CARDSTOCK MODELING Math Manipulative Kit Student Activity Book TABLE OF CONTENTS Activity Sheet for L.E. #1 - Getting Started...3-4 Activity Sheet for L.E. #2 - Squares and Cubes (Hexahedrons)...5-8 Activity
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 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 informationAccelerated Geometry: Course Level: 10th or 11th grade (students who have not had Geomtery I) Course Code: MA?? Course Length: ( Pre-requisite
Accelerated Geometry: Course Level: 10 th or 11 th grade (students who have not had Geomtery I) Course Code: MA?? Course Length: (1 semester) Pre-requisite: Algebra I (MA113/123) Description: This accelerated
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 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 informationMatrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation
Chapter 7 Introduction to Matrices This chapter introduces the theory and application of matrices. It is divided into two main sections. Section 7.1 discusses some of the basic properties and operations
More informationPatterned Polyhedra: Tiling the Platonic Solids
Patterned Polyhedra: Tiling the Platonic Solids B.G. Thomas* and M.A. Hann School of Design, University of Leeds Leeds, LS2 9JT, UK b.g.thomas@leeds.ac.uk Abstract This paper examines a range of geometric
More informationSection 9.4. Volume and Surface Area. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 9.4 Volume and Surface Area What You Will Learn Volume Surface Area 9.4-2 Volume Volume is the measure of the capacity of a three-dimensional figure. It is the amount of material you can put inside
More informationConnected Holes. Rinus Roelofs Sculptor Lansinkweg AL Hengelo The Netherlands
Connected Holes Rinus Roelofs Sculptor Lansinkweg 28 7553AL Hengelo The Netherlands E-mail: rinus@rinusroelofs.nl www.rinusroelofs.nl Abstract It is possible to make interwoven structures by using two
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 informationKey Concept Euler s Formula
11-1 Space Figures and Cross Sections Objectives To recognize polyhedrons and their parts To visualize cross sections of space figures Common Core State Standards G-GMD.B.4 Identify the shapes of two-dimensional
More informationWeek 7 Convex Hulls in 3D
1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons
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 informationFrom a Subdivided Tetrahedron to the Dodecahedron: Exploring Regular Colorings
From a Subdivided Tetrahedron to the Dodecahedron: Exploring Regular Colorings Eva Knoll School of Education, University of Exeter, England evaknoll@netscape.net Abstract The following paper recounts the
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 informationSurprises in high dimensions. Martin Lotz Galois Group, April 22, 2015
Surprises in high dimensions Martin Lotz Galois Group, April 22, 2015 Ladd Ehlinger Jr. (dir). Flatland, 2007. Life in 2D Life in 2D Edwin A. Abbott. Flatland: A Romance of Many Dimensions, 1884. The novella
More informationSymmetry: Geometry and Elementary Group Theory
Symmetry: Geometry and Elementary Group Theory Cooper Union Summer Research Internship August 16, 2012 Gordon Arrowsmith-Kron Kiril Bejoulev Thomas Bender Anwar Jammal Ali Janati Sam Krickellas Alex Li
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 informationIntermediate Math Circles Fall 2018 Patterns & Counting
Intermediate Math Circles Fall 2018 Patterns & Counting Michael Miniou The Centre for Education in Mathematics and Computing Faculty of Mathematics University of Waterloo December 5, 2018 Michael Miniou
More informationAlgorithms: Graphs. Amotz Bar-Noy. Spring 2012 CUNY. Amotz Bar-Noy (CUNY) Graphs Spring / 95
Algorithms: Graphs Amotz Bar-Noy CUNY Spring 2012 Amotz Bar-Noy (CUNY) Graphs Spring 2012 1 / 95 Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Amotz
More informationChapel Hill Math Circle: Symmetry and Fractals
Chapel Hill Math Circle: Symmetry and Fractals 10/7/17 1 Introduction This worksheet will explore symmetry. To mathematicians, a symmetry of an object is, roughly speaking, a transformation that does not
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 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 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 informationGeometry Transformations
Geometry Transformations NAME Period 1 Transformations Notes Transformation: Maps an, called a, onto a final, called an. Reflection: a transformation representing a of a figure Reflecting over the x-axis,
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 informationPlanar Graphs and Surfaces. Graphs 2 1/58
Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
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 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 information