DOCSLIB.ORG

Classifying Regular Polytopes in Dimension 4 and Beyond Brittany Johnson Western Oregon University, [email protected]

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Classifying Regular Polytopes in Dimension 4 and Beyond Brittany Johnson Western Oregon University, Bjohnson13@Mail.Wou.Edu Western Oregon University Digital Commons@WOU Academic Excellence Showcase Proceedings Student Scholarship 2018-06-01 Classifying Regular Polytopes in Dimension 4 and Beyond Brittany Johnson Western Oregon University, [email protected] Follow this and additional works at: https://digitalcommons.wou.edu/aes Part of the Physical Sciences and Mathematics Commons Recommended Citation Johnson, Brittany, "Classifying Regular Polytopes in Dimension 4 and Beyond" (2018). Academic Excellence Showcase Proceedings. 115. https://digitalcommons.wou.edu/aes/115 This Presentation is brought to you for free and open access by the Student Scholarship at Digital Commons@WOU. It has been accepted for inclusion in Academic Excellence Showcase Proceedings by an authorized administrator of Digital Commons@WOU. For more information, please contact [email protected], [email protected], [email protected]. Introduction Polygons, Polyhedra, Polychora Higher Dimension Polytopes Classifying Regular Polytopes in Dimension 4 and Beyond Brittany Johnson Western Oregon University May 31, 2018 Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond How many regular convex polytopes are there in each dimension? How can we prove this? Introduction Polygons, Polyhedra, Polychora Motivating Questions Higher Dimension Polytopes Motivating Questions Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond How can we prove this? Introduction Polygons, Polyhedra, Polychora Motivating Questions Higher Dimension Polytopes Motivating Questions How many regular convex polytopes are there in each dimension? Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons, Polyhedra, Polychora Motivating Questions Higher Dimension Polytopes Motivating Questions How many regular convex polytopes are there in each dimension? How can we prove this? Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Definition A polygon is a closed and connected shaped bounded by a finite number of lines. Polygons Not Polygons Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Definition A regular convex polygon is a polygon that is equilateral, equiangular, and whose interior forms a convex set. Regular Convex Polygons Not Regular Convex Polygons Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond All sides are the same lengths The interior angles are all congruent They can be represented by a Schl¨aflisymbol This is of the form {p} where p represents the number of sides It is unique {3} {4} {5} {6} {7} (we can keep going!) There are infinitely many! Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Important things to notice: Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond The interior angles are all congruent They can be represented by a Schl¨aflisymbol This is of the form {p} where p represents the number of sides It is unique {3} {4} {5} {6} {7} (we can keep going!) There are infinitely many! Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Important things to notice: All sides are the same lengths Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond They can be represented by a Schl¨aflisymbol This is of the form {p} where p represents the number of sides It is unique {3} {4} {5} {6} {7} (we can keep going!) There are infinitely many! Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Important things to notice: All sides are the same lengths The interior angles are all congruent Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond There are infinitely many! Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Important things to notice: All sides are the same lengths The interior angles are all congruent They can be represented by a Schl¨aflisymbol This is of the form {p} where p represents the number of sides It is unique {3} {4} {5} {6} {7} (we can keep going!) Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polygons Important things to notice: All sides are the same lengths The interior angles are all congruent They can be represented by a Schl¨aflisymbol This is of the form {p} where p represents the number of sides It is unique {3} {4} {5} {6} {7} (we can keep going!) There are infinitely many! Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond ANSWER: The regular convex polyhedra, or the Platonic solids Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra QUESTION: What is the 3-dimensional analog of the 2-dimensional regular convex polygons? Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra QUESTION: What is the 3-dimensional analog of the 2-dimensional regular convex polygons? ANSWER: The regular convex polyhedra, or the Platonic solids Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Notice that the faces are a regular polygon! All sides are the same All faces are congruent lengths Interior angles are congruent Angles formed by faces are congruent Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) Square Cube Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Notice that the faces are a Interior angles are regular polygon! congruent Angles formed by faces are congruent Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) Square Cube All sides are the same All faces are congruent lengths Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Interior angles are congruent Angles formed by faces are congruent Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) Square Cube All sides are the same All faces are congruent lengths Notice that the faces are a regular polygon! Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) Square Cube All sides are the same All faces are congruent lengths Notice that the faces are a Interior angles are regular polygon! congruent Angles formed by faces are congruent Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond { 4 , 3 } {4} {3} Square facet Triangle vertex figure Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) { p , q } Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond {4} {3} Square facet Triangle vertex figure Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) { p , q } { 4 , 3 } Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond {3} Triangle vertex figure Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) { p , q } { 4 , 3 } {4} Square facet Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) { p , q } { 4 , 3 } {4} {3} Square facet Triangle vertex figure Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond Introduction Polygons Polygons, Polyhedra, Polychora Polyhedra Higher Dimension Polytopes Polychora Regular Convex Polyhedra (The Platonic Solids) Definition An n-polytope’s facets are the type of (n − 1)-polytopes that bound it. Definition The vertex figure of an n-polytope is the (n − 1)-dimensional convex hull formed by connecting the center of each of the (n − 2)-elements that are incident on a given vertex. Brittany Johnson Western Oregon University Classifying Regular Polytopes in Dimension 4 and Beyond In other words, the sum of the interior angles that meet
Load more

Recommended publications
  • Abstract Regular Polytopes
    ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS Abstract Regular Polytopes PETER MMULLEN University College London EGON SCHULTE Northeastern University PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE The Pitt Building, Trumpington Street, Cambridge, United Kingdom CAMBRIDGE UNIVERSITY PRESS The Edinburgh Building, Cambridge CB2 2RU, UK 40 West 20th Street, New York, NY 10011-4211, USA 477 Williamstown Road, Port Melbourne, VIC 3207, Australia Ruiz de Alarc´on 13, 28014 Madrid, Spain Dock House, The Waterfront, Cape Town 8001, South Africa http://www.cambridge.org c Peter McMullen and Egon Schulte 2002 This book is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 2002 Printed in the United States of America Typeface Times New Roman 10/12.5 pt. System LATEX2ε [] A catalog record for this book is available from the British Library. Library of Congress Cataloging in Publication Data McMullen, Peter, 1955– Abstract regular polytopes / Peter McMullen, Egon Schulte. p. cm. – (Encyclopedia of mathematics and its applications) Includes bibliographical references and index. ISBN 0-521-81496-0 1. Polytopes. I. Schulte, Egon, 1955– II. Title. III. Series. QA691 .M395 2002 516.35 – dc21 2002017391 ISBN 0 521 81496 0 hardback Contents Preface page xiii 1 Classical Regular Polytopes 1 1A The Historical Background 1 1B Regular Convex Polytopes 7 1C Extensions
    [Show full text]
  • Uniform Polychora
    BRIDGES Mathematical Connections in Art, Music, and Science Uniform Polychora Jonathan Bowers 11448 Lori Ln Tyler, TX 75709 E-mail: [email protected] Abstract Like polyhedra, polychora are beautiful aesthetic structures - with one difference - polychora are four dimensional. Although they are beyond human comprehension to visualize, one can look at various projections or cross sections which are three dimensional and usually very intricate, these make outstanding pieces of art both in model form or in computer graphics. Polygons and polyhedra have been known since ancient times, but little study has gone into the next dimension - until recently. Definitions A polychoron is basically a four dimensional "polyhedron" in the same since that a polyhedron is a three dimensional "polygon". To be more precise - a polychoron is a 4-dimensional "solid" bounded by cells with the following criteria: 1) each cell is adjacent to only one other cell for each face, 2) no subset of cells fits criteria 1, 3) no two adjacent cells are corealmic. If criteria 1 fails, then the figure is degenerate. The word "polychoron" was invented by George Olshevsky with the following construction: poly = many and choron = rooms or cells. A polytope (polyhedron, polychoron, etc.) is uniform if it is vertex transitive and it's facets are uniform (a uniform polygon is a regular polygon). Degenerate figures can also be uniform under the same conditions. A vertex figure is the figure representing the shape and "solid" angle of the vertices, ex: the vertex figure of a cube is a triangle with edge length of the square root of 2.
    [Show full text]
  • Report on the Comparison of Tesseract and ABBYY Finereader OCR Engines
    IMPACT is supported by the European Community under the FP7 ICT Work Programme. The project is coordinated by the National Library of the Netherlands. Report on the comparison of Tesseract and ABBYY FineReader OCR engines Marcin Heliński, Miłosz Kmieciak, Tomasz Parkoła Poznań Supercomputing and Networking Center, Poland Table of contents 1. Introduction ............................................................................................................................ 2 2. Training process .................................................................................................................... 2 2.1 Tesseract training process ................................................................................................ 3 2.2 FineReader training process ............................................................................................. 8 3. Comparison of Tesseract and FineReader ............................................................................10 3.1 Evaluation scenario .........................................................................................................10 3.1.2 Evaluation criteria ......................................................................................................12 3.2. OCR recognition accuracy results ...................................................................................13 3.3 Comparison of Tesseract and FineReader recognition accuracy .....................................20 4 Conclusions ...........................................................................................................................23
    [Show full text]
  • 1 Critical Noncolorings of the 600-Cell Proving the Bell-Kochen-Specker
    Critical noncolorings of the 600-cell proving the Bell-Kochen-Specker theorem Mordecai Waegell* and P.K.Aravind** Physics Department Worcester Polytechnic Institute Worcester, MA 01609 *[email protected] ,** [email protected] ABSTRACT Aravind and Lee-Elkin (1998) gave a proof of the Bell-Kochen-Specker theorem by showing that it is impossible to color the 60 directions from the center of a 600-cell to its vertices in a certain way. This paper refines that result by showing that the 60 directions contain many subsets of 36 and 30 directions that cannot be similarly colored, and so provide more economical demonstrations of the theorem. Further, these subsets are shown to be critical in the sense that deleting even a single direction from any of them causes the proof to fail. The critical sets of size 36 and 30 are shown to belong to orbits of 200 and 240 members, respectively, under the symmetries of the polytope. A comparison is made between these critical sets and other such sets in four dimensions, and the significance of these results is discussed. 1. Introduction Some time back Lee-Elkin and one of us [1] gave a proof of the Bell-Kochen-Specker (BKS) theorem [2,3] by showing that it is impossible to color the 60 directions from the center of a 600- cell to its vertices in a certain way. This paper refines that result in two ways. Firstly, it shows that the 60 directions contain many subsets of 36 and 30 directions that cannot be similarly colored, and so provide more economical demonstrations of the theorem.
    [Show full text]
  • Arxiv:Math/9906062V1 [Math.MG] 10 Jun 1999 Udo Udmna Eerh(Rn 96-01-00166)
    Embedding the graphs of regular tilings and star-honeycombs into the graphs of hypercubes and cubic lattices ∗ Michel DEZA CNRS and Ecole Normale Sup´erieure, Paris, France Mikhail SHTOGRIN Steklov Mathematical Institute, 117966 Moscow GSP-1, Russia Abstract We review the regular tilings of d-sphere, Euclidean d-space, hyperbolic d-space and Coxeter’s regular hyperbolic honeycombs (with infinite or star-shaped cells or vertex figures) with respect of possible embedding, isometric up to a scale, of their skeletons into a m-cube or m-dimensional cubic lattice. In section 2 the last remaining 2-dimensional case is decided: for any odd m ≥ 7, star-honeycombs m m {m, 2 } are embeddable while { 2 ,m} are not (unique case of non-embedding for dimension 2). As a spherical analogue of those honeycombs, we enumerate, in section 3, 36 Riemann surfaces representing all nine regular polyhedra on the sphere. In section 4, non-embeddability of all remaining star-honeycombs (on 3-sphere and hyperbolic 4-space) is proved. In the last section 5, all cases of embedding for dimension d> 2 are identified. Besides hyper-simplices and hyper-octahedra, they are exactly those with bipartite skeleton: hyper-cubes, cubic lattices and 8, 2, 1 tilings of hyperbolic 3-, 4-, 5-space (only two, {4, 3, 5} and {4, 3, 3, 5}, of those 11 have compact both, facets and vertex figures). 1 Introduction arXiv:math/9906062v1 [math.MG] 10 Jun 1999 We say that given tiling (or honeycomb) T has a l1-graph and embeds up to scale λ into m-cube Hm (or, if the graph is infinite, into cubic lattice Zm ), if there exists a mapping f of the vertex-set of the skeleton graph of T into the vertex-set of Hm (or Zm) such that λdT (vi, vj)= ||f(vi), f(vj)||l1 = X |fk(vi) − fk(vj)| for all vertices vi, vj, 1≤k≤m ∗This work was supported by the Volkswagen-Stiftung (RiP-program at Oberwolfach) and Russian fund of fundamental research (grant 96-01-00166).
    [Show full text]
  • A Tourist Guide to the RCSR
    A tourist guide to the RCSR Some of the sights, curiosities, and little-visited by-ways Michael O'Keeffe, Arizona State University RCSR is a Reticular Chemistry Structure Resource available at http://rcsr.net. It is open every day of the year, 24 hours a day, and admission is free. It consists of data for polyhedra and 2-periodic and 3-periodic structures (nets). Visitors unfamiliar with the resource are urged to read the "about" link first. This guide assumes you have. The guide is designed to draw attention to some of the attractions therein. If they sound particularly attractive please visit them. It can be a nice way to spend a rainy Sunday afternoon. OKH refers to M. O'Keeffe & B. G. Hyde. Crystal Structures I: Patterns and Symmetry. Mineral. Soc. Am. 1966. This is out of print but due as a Dover reprint 2019. POLYHEDRA Read the "about" for hints on how to use the polyhedron data to make accurate drawings of polyhedra using crystal drawing programs such as CrystalMaker (see "links" for that program). Note that they are Cartesian coordinates for (roughly) equal edge. To make the drawing with unit edge set the unit cell edges to all 10 and divide the coordinates given by 10. There seems to be no generally-agreed best embedding for complex polyhedra. It is generally not possible to have equal edge, vertices on a sphere and planar faces. Keywords used in the search include: Simple. Each vertex is trivalent (three edges meet at each vertex) Simplicial. Each face is a triangle.
    [Show full text]
  • Petrie Schemes
    Canad. J. Math. Vol. 57 (4), 2005 pp. 844–870 Petrie Schemes Gordon Williams Abstract. Petrie polygons, especially as they arise in the study of regular polytopes and Coxeter groups, have been studied by geometers and group theorists since the early part of the twentieth century. An open question is the determination of which polyhedra possess Petrie polygons that are simple closed curves. The current work explores combinatorial structures in abstract polytopes, called Petrie schemes, that generalize the notion of a Petrie polygon. It is established that all of the regular convex polytopes and honeycombs in Euclidean spaces, as well as all of the Grunbaum–Dress¨ polyhedra, pos- sess Petrie schemes that are not self-intersecting and thus have Petrie polygons that are simple closed curves. Partial results are obtained for several other classes of less symmetric polytopes. 1 Introduction Historically, polyhedra have been conceived of either as closed surfaces (usually topo- logical spheres) made up of planar polygons joined edge to edge or as solids enclosed by such a surface. In recent times, mathematicians have considered polyhedra to be convex polytopes, simplicial spheres, or combinatorial structures such as abstract polytopes or incidence complexes. A Petrie polygon of a polyhedron is a sequence of edges of the polyhedron where any two consecutive elements of the sequence have a vertex and face in common, but no three consecutive edges share a commonface. For the regular polyhedra, the Petrie polygons form the equatorial skew polygons. Petrie polygons may be defined analogously for polytopes as well. Petrie polygons have been very useful in the study of polyhedra and polytopes, especially regular polytopes.
    [Show full text]
  • Four-Dimensional Regular Polytopes
    faculty of science mathematics and applied and engineering mathematics Four-dimensional regular polytopes Bachelor’s Project Mathematics November 2020 Student: S.H.E. Kamps First supervisor: Prof.dr. J. Top Second assessor: P. Kiliçer, PhD Abstract Since Ancient times, Mathematicians have been interested in the study of convex, regular poly- hedra and their beautiful symmetries. These five polyhedra are also known as the Platonic Solids. In the 19th century, the four-dimensional analogues of the Platonic solids were described mathe- matically, adding one regular polytope to the collection with no analogue regular polyhedron. This thesis describes the six convex, regular polytopes in four-dimensional Euclidean space. The focus lies on deriving information about their cells, faces, edges and vertices. Besides that, the symmetry groups of the polytopes are touched upon. To better understand the notions of regularity and sym- metry in four dimensions, our journey begins in three-dimensional space. In this light, the thesis also works out the details of a proof of prof. dr. J. Top, showing there exist exactly five convex, regular polyhedra in three-dimensional space. Keywords: Regular convex 4-polytopes, Platonic solids, symmetry groups Acknowledgements I would like to thank prof. dr. J. Top for supervising this thesis online and adapting to the cir- cumstances of Covid-19. I also want to thank him for his patience, and all his useful comments in and outside my LATEX-file. Also many thanks to my second supervisor, dr. P. Kılıçer. Furthermore, I would like to thank Jeanne for all her hospitality and kindness to welcome me in her home during the process of writing this thesis.
    [Show full text]
  • Regular Polyhedra Through Time
    Fields Institute I. Hubard Polytopes, Maps and their Symmetries September 2011 Regular polyhedra through time The greeks were the first to study the symmetries of polyhedra. Euclid, in his Elements showed that there are only five regular solids (that can be seen in Figure 1). In this context, a polyhe- dron is regular if all its polygons are regular and equal, and you can find the same number of them at each vertex. Figure 1: Platonic Solids. It is until 1619 that Kepler finds other two regular polyhedra: the great dodecahedron and the great icosahedron (on Figure 2. To do so, he allows \false" vertices and intersection of the (convex) faces of the polyhedra at points that are not vertices of the polyhedron, just as the I. Hubard Polytopes, Maps and their Symmetries Page 1 Figure 2: Kepler polyhedra. 1619. pentagram allows intersection of edges at points that are not vertices of the polygon. In this way, the vertex-figure of these two polyhedra are pentagrams (see Figure 3). Figure 3: A regular convex pentagon and a pentagram, also regular! In 1809 Poinsot re-discover Kepler's polyhedra, and discovers its duals: the small stellated dodecahedron and the great stellated dodecahedron (that are shown in Figure 4). The faces of such duals are pentagrams, and are organized on a \convex" way around each vertex. Figure 4: The other two Kepler-Poinsot polyhedra. 1809. A couple of years later Cauchy showed that these are the only four regular \star" polyhedra. We note that the convex hull of the great dodecahedron, great icosahedron and small stellated dodecahedron is the icosahedron, while the convex hull of the great stellated dodecahedron is the dodecahedron.
    [Show full text]
  • 15 BASIC PROPERTIES of CONVEX POLYTOPES Martin Henk, J¨Urgenrichter-Gebert, and G¨Unterm
    15 BASIC PROPERTIES OF CONVEX POLYTOPES Martin Henk, J¨urgenRichter-Gebert, and G¨unterM. Ziegler INTRODUCTION Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their im- portance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry to linear and combinatorial optimiza- tion. In this chapter we try to give a short introduction, provide a sketch of \what polytopes look like" and \how they behave," with many explicit examples, and briefly state some main results (where further details are given in subsequent chap- ters of this Handbook). We concentrate on two main topics: • Combinatorial properties: faces (vertices, edges, . , facets) of polytopes and their relations, with special treatments of the classes of low-dimensional poly- topes and of polytopes \with few vertices;" • Geometric properties: volume and surface area, mixed volumes, and quer- massintegrals, including explicit formulas for the cases of the regular simplices, cubes, and cross-polytopes. We refer to Gr¨unbaum [Gr¨u67]for a comprehensive view of polytope theory, and to Ziegler [Zie95] respectively to Gruber [Gru07] and Schneider [Sch14] for detailed treatments of the combinatorial and of the convex geometric aspects of polytope theory. 15.1 COMBINATORIAL STRUCTURE GLOSSARY d V-polytope: The convex hull of a finite set X = fx1; : : : ; xng of points in R , n n X i X P = conv(X) := λix λ1; : : : ; λn ≥ 0; λi = 1 : i=1 i=1 H-polytope: The solution set of a finite system of linear inequalities, d T P = P (A; b) := x 2 R j ai x ≤ bi for 1 ≤ i ≤ m ; with the extra condition that the set of solutions is bounded, that is, such that m×d there is a constant N such that jjxjj ≤ N holds for all x 2 P .
    [Show full text]
  • Convex Polytopes and Tilings with Few Flag Orbits
    Convex Polytopes and Tilings with Few Flag Orbits by Nicholas Matteo B.A. in Mathematics, Miami University M.A. in Mathematics, Miami 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 Abstract of Dissertation The amount of symmetry possessed by a convex polytope, or a tiling by convex polytopes, is reflected by the number of orbits of its flags under the action of the Euclidean isometries preserving the polytope. The convex polytopes with only one flag orbit have been classified since the work of Schläfli in the 19th century. In this dissertation, convex polytopes with up to three flag orbits are classified. Two-orbit convex polytopes exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the icosidodecahedron, the rhombic dodecahedron, and the rhombic triacontahedron. Two-orbit face-to-face tilings by convex polytopes exist on E1, E2, and E3; the only ones which are also combinatorially two-orbit are the trihexagonal plane tiling, the rhombille plane tiling, the tetrahedral-octahedral honeycomb, and the rhombic dodecahedral honeycomb. Moreover, any combinatorially two-orbit convex polytope or tiling is isomorphic to one on the above list. Three-orbit convex polytopes exist in two through eight dimensions. There are infinitely many in three dimensions, including prisms over regular polygons, truncated Platonic solids, and their dual bipyramids and Kleetopes. There are infinitely many in four dimensions, comprising the rectified regular 4-polytopes, the p; p-duoprisms, the bitruncated 4-simplex, the bitruncated 24-cell, and their duals.
    [Show full text]
  • 3D Visualization Models of the Regular Polytopes in Four and Higher Dimensions
    BRIDGES Mathematical Connections in Art, Music, and Science 3D Visualization Models of the Regular Polytopes in Four and Higher Dimensions Carlo H. Sequin Computer Science Division, EECS Department University of California, Berkeley, CA 94720 E-maih [email protected] Abstract This paper presents a tutorial review of the construction of all regular polytopes in spaces of all possible dimensions . .It focusses on how to make instructive, 3-dimensional, physical visualization models for the polytopes of dimensions 4 through 6, using solid free-form fabrication technology. 1. Introduction Polytope is a generalization of the terms in the sequence: point, segment, polygon, polyhedron ... [1]. Such a polytope is called regular, if all its elements (vertices, edges, faces, cells ... ) are indistinguishable, i.e., if there exists a group of spatial transformations (rotations, mirroring) that will bring the polytope into coverage with itself. Through these symmetry operations, it must be possible to transform any particular element of the polytope into any other chosen element of the same kind. In two dimensions, there exist infinitely many regular polygons; the first five are shown in Figure 1. • • • Figure 1: The simplest regular 2D polygons. In three-dimensional space, there are just five regular polyhedra -- the Platonic solids, and they can readily be depicted by using shaded perspective renderings (Fig.2). As we contemplate higher dimensions and the regular polytopes that they may admit, it becomes progressively harder to understand the geometry of these objects. Projections down to two (printable) dimensions discard a fair amount of information, and people often have difficulties comprehending even 4D polytopes, when only shown pictures or 2D graphs.
    [Show full text]