Math.MG] 25 Sep 2012 Oisb Ue N Ops,O Ae Folding
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On the Archimedean Or Semiregular Polyhedra
ON THE ARCHIMEDEAN OR SEMIREGULAR POLYHEDRA Mark B. Villarino Depto. de Matem´atica, Universidad de Costa Rica, 2060 San Jos´e, Costa Rica May 11, 2005 Abstract We prove that there are thirteen Archimedean/semiregular polyhedra by using Euler’s polyhedral formula. Contents 1 Introduction 2 1.1 RegularPolyhedra .............................. 2 1.2 Archimedean/semiregular polyhedra . ..... 2 2 Proof techniques 3 2.1 Euclid’s proof for regular polyhedra . ..... 3 2.2 Euler’s polyhedral formula for regular polyhedra . ......... 4 2.3 ProofsofArchimedes’theorem. .. 4 3 Three lemmas 5 3.1 Lemma1.................................... 5 3.2 Lemma2.................................... 6 3.3 Lemma3.................................... 7 4 Topological Proof of Archimedes’ theorem 8 arXiv:math/0505488v1 [math.GT] 24 May 2005 4.1 Case1: fivefacesmeetatavertex: r=5. .. 8 4.1.1 At least one face is a triangle: p1 =3................ 8 4.1.2 All faces have at least four sides: p1 > 4 .............. 9 4.2 Case2: fourfacesmeetatavertex: r=4 . .. 10 4.2.1 At least one face is a triangle: p1 =3................ 10 4.2.2 All faces have at least four sides: p1 > 4 .............. 11 4.3 Case3: threefacesmeetatavertes: r=3 . ... 11 4.3.1 At least one face is a triangle: p1 =3................ 11 4.3.2 All faces have at least four sides and one exactly four sides: p1 =4 6 p2 6 p3. 12 4.3.3 All faces have at least five sides and one exactly five sides: p1 =5 6 p2 6 p3 13 1 5 Summary of our results 13 6 Final remarks 14 1 Introduction 1.1 Regular Polyhedra A polyhedron may be intuitively conceived as a “solid figure” bounded by plane faces and straight line edges so arranged that every edge joins exactly two (no more, no less) vertices and is a common side of two faces. -
Archimedean Solids
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2008 Archimedean Solids Anna Anderson University of Nebraska-Lincoln Follow this and additional works at: https://digitalcommons.unl.edu/mathmidexppap Part of the Science and Mathematics Education Commons Anderson, Anna, "Archimedean Solids" (2008). MAT Exam Expository Papers. 4. https://digitalcommons.unl.edu/mathmidexppap/4 This Article is brought to you for free and open access by the Math in the Middle Institute Partnership at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in MAT Exam Expository Papers by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Archimedean Solids Anna Anderson In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics in the Department of Mathematics. Jim Lewis, Advisor July 2008 2 Archimedean Solids A polygon is a simple, closed, planar figure with sides formed by joining line segments, where each line segment intersects exactly two others. If all of the sides have the same length and all of the angles are congruent, the polygon is called regular. The sum of the angles of a regular polygon with n sides, where n is 3 or more, is 180° x (n – 2) degrees. If a regular polygon were connected with other regular polygons in three dimensional space, a polyhedron could be created. In geometry, a polyhedron is a three- dimensional solid which consists of a collection of polygons joined at their edges. The word polyhedron is derived from the Greek word poly (many) and the Indo-European term hedron (seat). -
New Perspectives on Polyhedral Molecules and Their Crystal Structures Santiago Alvarez, Jorge Echeverria
New Perspectives on Polyhedral Molecules and their Crystal Structures Santiago Alvarez, Jorge Echeverria To cite this version: Santiago Alvarez, Jorge Echeverria. New Perspectives on Polyhedral Molecules and their Crystal Structures. Journal of Physical Organic Chemistry, Wiley, 2010, 23 (11), pp.1080. 10.1002/poc.1735. hal-00589441 HAL Id: hal-00589441 https://hal.archives-ouvertes.fr/hal-00589441 Submitted on 29 Apr 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Journal of Physical Organic Chemistry New Perspectives on Polyhedral Molecules and their Crystal Structures For Peer Review Journal: Journal of Physical Organic Chemistry Manuscript ID: POC-09-0305.R1 Wiley - Manuscript type: Research Article Date Submitted by the 06-Apr-2010 Author: Complete List of Authors: Alvarez, Santiago; Universitat de Barcelona, Departament de Quimica Inorganica Echeverria, Jorge; Universitat de Barcelona, Departament de Quimica Inorganica continuous shape measures, stereochemistry, shape maps, Keywords: polyhedranes http://mc.manuscriptcentral.com/poc Page 1 of 20 Journal of Physical Organic Chemistry 1 2 3 4 5 6 7 8 9 10 New Perspectives on Polyhedral Molecules and their Crystal Structures 11 12 Santiago Alvarez, Jorge Echeverría 13 14 15 Departament de Química Inorgànica and Institut de Química Teòrica i Computacional, 16 Universitat de Barcelona, Martí i Franquès 1-11, 08028 Barcelona (Spain). -
About Weaving and Helical Holes
Bridges 2010: Mathematics, Music, Art, Architecture, Culture About Weaving and Helical Holes Rinus Roelofs Sculptor Lansinkweg 28 7553AL Hengelo The Netherlands E-mail: [email protected] www.rinusroelofs.nl Abstract Weaving is an invention of man, and maybe one of the most important inventions in the field of construction. There are many weave patterns but most weave patterns are based on just two different grids, the plain weave and the three way weave. The development of weaving is mainly connected to the possibilities of manufacturing. In this paper I want to investigate this ‘passing one thread over another’-concept from a mathematical-artistic point of view. 1. Introduction 1.1. Over and Under. In Leonardo’s painting on the ceiling of the Sala delle Asse in the Sforza Castle in Milan (Figure 1) we can see different weaving patterns: the knotted ropes and the interwoven branches. Both can only be realized with the aid of man. Nature doesn’t weave by itself, at least not in the way Leonardo shows us in his painting. When we look for a definition of weaving we can find the following: weaving is the textile art in which two distinct sets of yarns or threads, called the warp and the filling or weft, are interlaced with each other to form a fabric or cloth. To define the concept of weaving in a more general way we could say that a weaving is a line pattern in which for each pair of adjacent crossing points on the line(s) the position of that line changes from ‘over’ to ‘under’ or from ‘under’ to ‘over’ (Figure 2a,b). -
Chapter 2 Figures and Shapes 2.1 Polyhedron in N-Dimension in Linear
Chapter 2 Figures and Shapes 2.1 Polyhedron in n-dimension In linear programming we know about the simplex method which is so named because the feasible region can be decomposed into simplexes. A zero-dimensional simplex is a point, an 1D simplex is a straight line segment, a 2D simplex is a triangle, a 3D simplex is a tetrahedron. In general, a n-dimensional simplex has n+1 vertices not all contained in a (n-1)- dimensional hyperplane. Therefore simplex is the simplest building block in the space it belongs. An n-dimensional polyhedron can be constructed from simplexes with only possible common face as their intersections. Such a definition is a bit vague and such a figure need not be connected. Connected polyhedron is the prototype of a closed manifold. We may use vertices, edges and faces (hyperplanes) to define a polyhedron. A polyhedron is convex if all convex linear combinations of the vertices Vi are inside itself, i.e. i Vi is contained inside for all i 0 and all _ i i 1. i If a polyhedron is not convex, then the smallest convex set which contains it is called the convex hull of the polyhedron. Separating hyperplane Theorem For any given point outside a convex set, there exists a hyperplane with this given point on one side of it and the entire convex set on the other. Proof: Because the given point will be outside one of the supporting hyperplanes of the convex set. 2.2 Platonic Solids Known to Plato (about 500 B.C.) and explained in the Elements (Book XIII) of Euclid (about 300 B.C.), these solids are governed by the rules that the faces are the regular polygons of a single species and the corners (vertices) are all alike. -
Dissection of Rhombic Solids with Octahedral Symmetry to Archimedean Solids, Part 2
Dissection of rhombic solids with octahedral symmetry to Archimedean solids, Part 2 Izidor Hafner In [5] we found "best approximate" by "rhombic solids" for certain Platonic and Archimedean solids with octahedral symmetry. In this paper we treat the remaining solids: truncated cube, rhombicubocahedron and truncated cuboctahedron. For this purpose we extend the notion of rhombic solid so, that it is also possible to add to them 1/4 and 1/8 of the rhombic dodecahedron and 1/6 of the cube. These last solids can be dissected to cubes. The authors of [1, pg. 331] produced the table of the Dehn invariants for the non-snub unit edge Archimedean polyhedra. We have considered the icosahedral part in [7]. Results from both papers show, that each best aproximate has a surplus or a deficit measured in tetrahedrons (T): -2, -1, 0, 1, 2. Actualy 1/4 of the tetrahedron appears as a piece. The table of Dehn invariant for the non-snub unit edge Archimedean polyhedra (octahedral part) [1]: Tetrahedron -12(3)2 Truncated tetrahedron 12(3)2 Cube 0 Truncated cube -24(3)2 Octahedron 24(3)2 Truncated octahedron 0 Rhombicuboctahedron -24(3)2 ??? Cuboctahedron -24(3)2 Truncated cuboctahedron 0 Along with the above table, we produced the following one: Tetrahedron 1 Truncated tetrahedron -1 Cube 0 Truncated cube 2 Octahedron -2 Truncated octahedron 0 Rhombicuboctahedron -2 Cuboctahedron 2 Truncated cuboctahedron 0 For instance: the tetrahedron has a surplus of 1 tetrahedron relative to empty polyhedron, the octahedron has deficit of 2 tetrahedra relative to rhombic dodecahedron. Our truncated cube, rhombicuboctahedron and truncated cuboctahedron are not Archimedean, but can be enlarged to Archimedean by addition of some prisms, so the results in the table are valid for Archimedean solids as well. -
Local Symmetry Preserving Operations on Polyhedra
Local Symmetry Preserving Operations on Polyhedra Pieter Goetschalckx Submitted to the Faculty of Sciences of Ghent University in fulfilment of the requirements for the degree of Doctor of Science: Mathematics. Supervisors prof. dr. dr. Kris Coolsaet dr. Nico Van Cleemput Chair prof. dr. Marnix Van Daele Examination Board prof. dr. Tomaž Pisanski prof. dr. Jan De Beule prof. dr. Tom De Medts dr. Carol T. Zamfirescu dr. Jan Goedgebeur © 2020 Pieter Goetschalckx Department of Applied Mathematics, Computer Science and Statistics Faculty of Sciences, Ghent University This work is licensed under a “CC BY 4.0” licence. https://creativecommons.org/licenses/by/4.0/deed.en In memory of John Horton Conway (1937–2020) Contents Acknowledgements 9 Dutch summary 13 Summary 17 List of publications 21 1 A brief history of operations on polyhedra 23 1 Platonic, Archimedean and Catalan solids . 23 2 Conway polyhedron notation . 31 3 The Goldberg-Coxeter construction . 32 3.1 Goldberg ....................... 32 3.2 Buckminster Fuller . 37 3.3 Caspar and Klug ................... 40 3.4 Coxeter ........................ 44 4 Other approaches ....................... 45 References ............................... 46 2 Embedded graphs, tilings and polyhedra 49 1 Combinatorial graphs .................... 49 2 Embedded graphs ....................... 51 3 Symmetry and isomorphisms . 55 4 Tilings .............................. 57 5 Polyhedra ............................ 59 6 Chamber systems ....................... 60 7 Connectivity .......................... 62 References -
Paper Models of Polyhedra
Paper Models of Polyhedra Gijs Korthals Altes Polyhedra are beautiful 3-D geometrical figures that have fascinated philosophers, mathematicians and artists for millennia Copyrights © 1998-2001 Gijs.Korthals Altes All rights reserved . It's permitted to make copies for non-commercial purposes only email: [email protected] Paper Models of Polyhedra Platonic Solids Dodecahedron Cube and Tetrahedron Octahedron Icosahedron Archimedean Solids Cuboctahedron Icosidodecahedron Truncated Tetrahedron Truncated Octahedron Truncated Cube Truncated Icosahedron (soccer ball) Truncated dodecahedron Rhombicuboctahedron Truncated Cuboctahedron Rhombicosidodecahedron Truncated Icosidodecahedron Snub Cube Snub Dodecahedron Kepler-Poinsot Polyhedra Great Stellated Dodecahedron Small Stellated Dodecahedron Great Icosahedron Great Dodecahedron Other Uniform Polyhedra Tetrahemihexahedron Octahemioctahedron Cubohemioctahedron Small Rhombihexahedron Small Rhombidodecahedron S mall Dodecahemiododecahedron Small Ditrigonal Icosidodecahedron Great Dodecahedron Compounds Stella Octangula Compound of Cube and Octahedron Compound of Dodecahedron and Icosahedron Compound of Two Cubes Compound of Three Cubes Compound of Five Cubes Compound of Five Octahedra Compound of Five Tetrahedra Compound of Truncated Icosahedron and Pentakisdodecahedron Other Polyhedra Pentagonal Hexecontahedron Pentagonalconsitetrahedron Pyramid Pentagonal Pyramid Decahedron Rhombic Dodecahedron Great Rhombihexacron Pentagonal Dipyramid Pentakisdodecahedron Small Triakisoctahedron Small Triambic -
How to Stay Away from Each Other in a Spherical Universe 1
GENERAL I ARTICLE How to Stay Away from Each Other in a Spherical Universe 1. Tammes' Problem Bhaskar Bagchi Mathematics is full of innocent looking problems which, when pursued, soon grow to majestic pro portions and begin to impinge upon the frontiers of research. One such problem is the subject of this two-part article - the problem of packing spherical caps on the surface of a sphere. Bhaskar Bagchi is with Twelve Men on a Sphere the Indian Statistical Institute since 1971, first For most practical purposes, we humans are inhabitants of as a student and then as a member of the faculty. a (two dimensional) spherical universe: we are constrained He is interested in to eke out our lives on the surface of the earth. Suppose diverse areas of twelve denizens of this spherical universe hate each other mathematics like so much that they decide to build their houses as far away combinatorics, from each other 88 possible. We assume that, except for elementary and analytic this morbid hatred, these guys have no other constraints: number theory, they may build their houses anywhere on the earth's surface functional analysis, (must be stinkingly rich to have such freedom!). The ques combinatorial topology tion is: how should these twelve houses be positioned ? The and statistics. answer depends, of course, on what we mean by the phrase 'as far away from each other as possible'. Let us take it to mean that the minimum of the pair-wise distances between the twelve houses is to be maximised subjected to the only Figure 1 Icosahedron. -
Wythoffian Skeletal Polyhedra
Wythoffian Skeletal Polyhedra by Abigail Williams B.S. in Mathematics, Bates College M.S. in Mathematics, Northeastern University A dissertation submitted to The Faculty of the College of Science of Northeastern University in partial fulfillment of the requirements for the degree of Doctor of Philosophy April 14, 2015 Dissertation directed by Egon Schulte Professor of Mathematics Dedication I would like to dedicate this dissertation to my Meme. She has always been my loudest cheerleader and has supported me in all that I have done. Thank you, Meme. ii Abstract of Dissertation Wythoff's construction can be used to generate new polyhedra from the symmetry groups of the regular polyhedra. In this dissertation we examine all polyhedra that can be generated through this construction from the 48 regular polyhedra. We also examine when the construction produces uniform polyhedra and then discuss other methods for finding uniform polyhedra. iii Acknowledgements I would like to start by thanking Professor Schulte for all of the guidance he has provided me over the last few years. He has given me interesting articles to read, provided invaluable commentary on this thesis, had many helpful and insightful discussions with me about my work, and invited me to wonderful conferences. I truly cannot thank him enough for all of his help. I am also very thankful to my committee members for their time and attention. Additionally, I want to thank my family and friends who, for years, have supported me and pretended to care everytime I start talking about math. Finally, I want to thank my husband, Keith. -
Operation-Based Notation for Archimedean Graph
Operation-Based Notation for Archimedean Graph Hidetoshi Nonaka Research Group of Mathematical Information Science Division of Computer Science, Hokkaido University N14W9, Sapporo, 060 0814, Japan ABSTRACT Table 1. The list of Archimedean solids, where p, q, r are the number of vertices, edges, and faces, respectively. We introduce three graph operations corresponding to Symbol Name of polyhedron p q r polyhedral operations. By applying these operations, thirteen Archimedean graphs can be generated from Platonic graphs that A(3⋅4)2 Cuboctahedron 12 24 14 are used as seed graphs. A4610⋅⋅ Great Rhombicosidodecahedron 120 180 62 A468⋅⋅ Great Rhombicuboctahedron 48 72 26 Keyword: Archimedean graph, Polyhedral graph, Polyhedron A 2 Icosidodecahedron 30 60 32 notation, Graph operation. (3⋅ 5) A3454⋅⋅⋅ Small Rhombicosidodecahedron 60 120 62 1. INTRODUCTION A3⋅43 Small Rhombicuboctahedron 24 48 26 A34 ⋅4 Snub Cube 24 60 38 Archimedean graph is a simple planar graph isomorphic to the A354 ⋅ Snub Dodecahedron 60 150 92 skeleton or wire-frame of the Archimedean solid. There are A38⋅ 2 Truncated Cube 24 36 14 thirteen Archimedean solids, which are semi-regular polyhedra A3⋅102 Truncated Dodecahedron 60 90 32 and the subset of uniform polyhedra. Seven of them can be A56⋅ 2 Truncated Icosahedron 60 90 32 formed by truncation of Platonic solids, and all of them can be A 2 Truncated Octahedron 24 36 14 formed by polyhedral operations defined as Conway polyhedron 4⋅6 A 2 Truncated Tetrahedron 12 18 8 notation [1-2]. 36⋅ The author has recently developed an interactive modeling system of uniform polyhedra including Platonic solids, Archimedean solids and Kepler-Poinsot solids, based on graph drawing and simulated elasticity, mainly for educational purpose [3-5]. -
Polyhedra from Symmetric Placement of Regular Polygons
Symmetrohedra: Polyhedra from Symmetric Placement of Regular Polygons Craig S. Kaplan George W. Hart University of Washington http://www.georgehart.com Box 352350, Seattle, WA 98195 USA [email protected] [email protected] Abstract In the quest for new visually interesting polyhedra with regular faces, we define and present an infinite class of solids, constructed by placing regular polygons at the rotational axes of a polyhedral symmetry group. This new technique can be used to generate many existing polyhedra, including most of the Archimedean solids. It also yields novel families of attractive symmetric polyhedra. 1 Introduction Most interesting polyhedra arise via a process that attempts to generate or preserve some measure of order. We might ask that the polyhedron be as symmetric as possible, that the symmetries act transitively on its vertices, edges or faces, or that all its faces be regular polygons. Indeed, these questions have all been asked and the resulting families of polyhedra enumerated to satisfaction. The last case, that of convex polyhedra all of whose faces are regular polygons, are the well-known Johnson solids [3]. Eager to discover new polyhedra with regular faces, but aware that the list of Johnson solids has been proven complete, we are faced with the prospect of letting some constraints slip a bit in order to innovate. We achieve this innovation by dropping the constraint that all faces be regular, asking only that many faces be regular, and that the remaining faces occur in a small number of different shapes. In this paper we define an infinite set of convex polyhedra that we call symmetrohedra.Theyare parameterized by several discrete and continuous values.