DOCSLIB.ORG

Drawing Planar Graphs Via Dessins D'enfants

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Drawing Planar Graphs Via Dessins D'enfants Drawing Planar Graphs via Dessins d'Enfants Kevin Bowman, Sheena Chandra, Anji Li and Amanda Llewellyn PRiME 2013: Purdue Research in Mathematics Experience, Purdue University July 21, 2013 Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 1 / 25 Belyi Maps Definition p(z) 1 1 A rational function β(z) = q(z) , where β : P (C) ! P (C), is a Belyi Map if it has at most three critical values, say f!(0);!(1);!(1)g. Remarks: 1 P (C) refers to the complex projective line, that is the set C [ f1g. 1 An ! 2 P (C) is a critical value of β(z) if β(z) = ! for some β0(z) = 0. Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 2 / 25 Belyi Maps Question Is β(z) = 4z5(1 − z5) a Belyi Map? 1 Form a polynomial equation !1 5 5 β(z) = () !0 4z (1 − z ) − !1 = 0 !0 2 Compute the discriminant 5 5 4 9 5 disc !0 4z (1 − z ) − !1 = (constant) !1 !0 (!1 − !0) 3 Find the roots !1 1 4 9 5 = 2 P (C) !1 !0 (!1 − !0) = 0 = f0; 1; 1g !0 Answer Yes, β(z) is a Belyi Map with critical values f0; 1; 1g Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 3 / 25 Dessin d'Enfant Definition Given a Belyi map β(z) = p(z)=q(z) we consider the preimages B = \black" vertices = β−1(0) W = \white" vertices = β−1(1) E = edges = β−1([0; 1]) F = midpoints of faces = β−1(1) We define the bipartite graph ∆β = (B [ W ; E) as the Dessin d'Enfant. Remarks: A bipartite graph is a collection of vertices and edges where the vertices are placed into two disjoint sets, none of whose elements are adjacent Following Grothendieck, \Dessin d'Enfants" is French for \Children's Drawings" Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 4 / 25 Dessin d'Enfant Example β(z) = 4z5(1 − z5) We found that β is a Belyi map with critical values 0; 1; 1. We consider its preimages B = β−1(0) = f0g [ f5th roots of 1g W = β−1(1) = f5th roots of 1=2g F = β−1(1) = f1g Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 5 / 25 Research Question Motivating Question Let Γ be a connected planar graph. Can we find a Belyi map β(z) such that Γ is the Dessin d'Enfant of this map? Remarks: A graph is connected if there is a path between any two points A graph is planar if it can be drawn without any edges crossing Any planar graph can be seen as a bipartite graph if we label all vertices as \black" and label all midpoints of edges as \white" Specific Question Given a specific web or a tree, can we explicitly find its corresponding Belyi map? Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 6 / 25 Methodology From a graph to a bipartite graph: 1) Label graph's vertices as \black" 2) Add \white" vertices as midpoints of edges Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 7 / 25 Methodology From a bipartite graph to a Belyi map: 3) Label "black" vertices as 1 B = fb1; b2; :::; br g ⊆ P (C) such that each point bk has ek edges incident. Since we want B = β−1(0), we must have r Y p(z) p(z) = (constant) (z − b )ek where β(z) = k q(z) k=1 Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 8 / 25 Methodology 4) Label \white" vertices as 1 W = fw1; w2; :::; wng ⊆ P (C) such that each point wk has 2 edges incident. Since we want W = β−1(1), we must have n Y p(z) p(z) − q(z) = (constant) (z − w )2 where β(z) = k q(z) k=1 5) Label midpoints of faces vertices as 1 F = ff1; f2; :::; fs g ⊆ P (C) such that each point fk has dk edges that enclose it. Since we want F = β−1(1), we must have s Y dk q(z) = (constant) (z − fk ) k=1 Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 9 / 25 Methodology Proposition If there exist constants bk ; wk ; fk ; p0; q0; r0 2 C such that r n s Y ek Y 2 Y dk p0 (z − bk ) − q0 (z − wk ) − r0 (z − fk ) = 0 k=1 k=1 k=1 | {z } | {z } | {z } vertices edges faces for all z, then the rational function r p Q (z − b )ek β(z) = − 0 k=1 k Qs dk r0 k=1(z − fk ) is a Belyi map of degree r s X X 2 n = ek = dk : k=1 k=1 Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 10 / 25 List of Results Cycles Dipoles Prisms Bipyramids Webs Antiprisms Trapezohedrons Wheels Gyroelongated Bipyramid Truncated Trapezohedron Paths Trees Stars Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 11 / 25 Graphing: Mathematica Notebook http://www.math.purdue.edu/∼egoins/site//Dessins%20d'Enfants.html Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 12 / 25 Cycles (zn − 1)2 β(z) = − 4zn Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 13 / 25 Dipoles 4zn β(z) = − (zn − 1)2 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 14 / 25 Prisms (z2n + 14zn + 1)3 β(z) = 108 zn(zn − 1)4 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 15 / 25 Bipyramids 108zn(zn − 1)4 β(z) = (z2n + 14zn + 1)3 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 16 / 25 Antiprisms (z2n + 10zn − 2)4 β(z) = 16(zn − 1)3(2zn + 1)3 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 17 / 25 Trapezohedron 16(zn − 1)3(2zn + 1)3 β(z) = (z2n + 10zn − 2)4 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 18 / 25 Wheels 64zn(zn − 1)3 β(z) = − (8zn + 1)3 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 19 / 25 Gyroelongated Bipyramid 1728zn(z2n + 11zn − 1)5 β(z) = − (z4n − 228z3n + 494z2n + 228zn + 1)3 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 20 / 25 Truncated Trapezohedron (z4n − 228z3n + 494z2n + 228zn + 1)3 β(z) = − 1728zn(z2n + 11zn − 1)5 Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 21 / 25 Paths β(z) = sin2(n cos−1 z) Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 22 / 25 Stars β(z) = 4zn(1 − zn) Wikipedia Mathematica Notebook Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 23 / 25 Further Research Find the Belyi maps for the following: Elongated Pyramid Gyroelongated Pyramid Rotunda Elongated Bipyramid Truncated Bipyramid Bicupola Birotunda Create a Mathematica notebook which will generate Belyi maps for any given tree or web. Find a Belyi map for the Stick Figure 1 3 2 4 6 7 5 P P Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 24 / 25 Acknowledgements The National Science Foundation (NSF) and Professor Steve Bell Dr. Joel Spira (Purdue BS '48, Physics) Andris \Andy" Zoltners (Purdue MS '69, Mathematics) Professor Edray Goins Andres Figuerola Drawing Planar Graphs via Dessins d'Enfants July 21, 2013 25 / 25.
Load more

Recommended publications
  • Snub Cell Tetricosa
    E COLE NORMALE SUPERIEURE ________________________ A Zo o of ` embeddable Polytopal Graphs Michel DEZA VP GRISHUHKIN LIENS ________________________ Département de Mathématiques et Informatique CNRS URA 1327 A Zo o of ` embeddable Polytopal Graphs Michel DEZA VP GRISHUHKIN LIENS January Lab oratoire dInformatique de lEcole Normale Superieure rue dUlm PARIS Cedex Tel Adresse electronique dmiensfr CEMI Russian Academy of Sciences Moscow A zo o of l embeddable p olytopal graphs MDeza CNRS Ecole Normale Superieure Paris VPGrishukhin CEMI Russian Academy of Sciences Moscow Abstract A simple graph G V E is called l graph if for some n 2 IN there 1 exists a vertexaddressing of each vertex v of G by a vertex av of the n cub e H preserving up to the scale the graph distance ie d v v n G d av av for all v 2 V We distinguish l graphs b etween skeletons H 1 n of a variety of well known classes of p olytop es semiregular regularfaced zonotop es Delaunay p olytop es of dimension and several generalizations of prisms and antiprisms Introduction Some notation and prop erties of p olytopal graphs and hypermetrics Vector representations of l metrics and hypermetrics 1 Regularfaced p olytop es Regular p olytop es Semiregular not regular p olytop es Regularfaced not semiregularp olytop es of dimension Prismatic graphs Moscow and Glob e graphs Stellated k gons Cup olas Antiwebs Capp ed antiprisms towers and fullerenes regularfaced not semiregular p olyhedra Zonotop es Delaunay p olytop es Small
    [Show full text]
  • A Fun Approach to Teaching Geometry and Inspiring Creativity
    Proceedings of Bridges 2013: Mathematics, Music, Art, Architecture, Culture A Fun Approach to Teaching Geometry and Inspiring Creativity Ioana Browne, Michael Browne, Mircea Draghicescu*, Cristina Draghicescu, Carmen Ionescu ITSPHUN LLC 2023 NW Lovejoy St. Portland, OR 97209, USA [email protected] Abstract ITSPHUNTM geometric shapes can be easily combined to create an infinite number of structures both decorative and functional. We introduce this system of shapes, and discuss its use for teaching mathematics. At the workshop, we will provide a large number of pieces of various shapes, demonstrate their use, and give all participants the opportunity to build their own creations at the intersection of art and mathematics. Introduction Connecting pieces of paper by sliding them together along slits or cuts is a well-known method of building 3D objects ([2], [3], [4]). Based on this idea we developed a system of shapes1 that can be used to build arbitrarily complex structures. Among the geometric objects that can be built are Platonic, Archimedean, and Johnson solids, prisms and antiprisms, many nonconvex polyhedra, several space-filling tessellations, etc. Guided by an user’s imagination and creativity, simple objects can then be connected to form more complex constructs. ITSPHUN pieces made of various materials2 can be used for creative play, for making functional and decorative objects such as jewelry, lamps, furniture, and, in classroom, for teaching mathematical concepts.3 1Patent pending. 2We used many kinds of paper, cardboard, foam, several kinds of plastic, wood and plywood, wood veneer, fabric, and felt. 3In addition to models of geometric objects, ITSPHUN shapes have been used to make birds, animals, flowers, trees, houses, hats, glasses, and much more - see a few examples in the photo gallery at www.itsphun.com.
    [Show full text]
  • [ENTRY POLYHEDRA] Authors: Oliver Knill: December 2000 Source: Translated Into This Format from Data Given In
    ENTRY POLYHEDRA [ENTRY POLYHEDRA] Authors: Oliver Knill: December 2000 Source: Translated into this format from data given in http://netlib.bell-labs.com/netlib tetrahedron The [tetrahedron] is a polyhedron with 4 vertices and 4 faces. The dual polyhedron is called tetrahedron. cube The [cube] is a polyhedron with 8 vertices and 6 faces. The dual polyhedron is called octahedron. hexahedron The [hexahedron] is a polyhedron with 8 vertices and 6 faces. The dual polyhedron is called octahedron. octahedron The [octahedron] is a polyhedron with 6 vertices and 8 faces. The dual polyhedron is called cube. dodecahedron The [dodecahedron] is a polyhedron with 20 vertices and 12 faces. The dual polyhedron is called icosahedron. icosahedron The [icosahedron] is a polyhedron with 12 vertices and 20 faces. The dual polyhedron is called dodecahedron. small stellated dodecahedron The [small stellated dodecahedron] is a polyhedron with 12 vertices and 12 faces. The dual polyhedron is called great dodecahedron. great dodecahedron The [great dodecahedron] is a polyhedron with 12 vertices and 12 faces. The dual polyhedron is called small stellated dodecahedron. great stellated dodecahedron The [great stellated dodecahedron] is a polyhedron with 20 vertices and 12 faces. The dual polyhedron is called great icosahedron. great icosahedron The [great icosahedron] is a polyhedron with 12 vertices and 20 faces. The dual polyhedron is called great stellated dodecahedron. truncated tetrahedron The [truncated tetrahedron] is a polyhedron with 12 vertices and 8 faces. The dual polyhedron is called triakis tetrahedron. cuboctahedron The [cuboctahedron] is a polyhedron with 12 vertices and 14 faces. The dual polyhedron is called rhombic dodecahedron.
    [Show full text]
  • Observations About Leonardo's Drawings for Luca Pacioli
    Observations about Leonardo’s drawings for Luca Pacioli DIRK HUYLEBROUCK Department for Architecture, KULeuven, Brussels, Belgium. Three versions of Luca Pacioli’s ‘De Divina Proportione’ remain: a manuscript held in Milan, another in Geneva and a printed version edited in Venice. A recent book, ‘Antologia della Divina Proporzione’, has all three in one volume, allowing an easy comparison of the different versions. The present paper proposes some observations about these drawings, generally said to be of Leonardo da Vinci’s hand. Three copies Three versions of Luca Pacioli’s ‘De divina proportione’ remain: there are the two manuscripts, one from the Bibliothèque de Genève and one from the Biblioteca Ambrosiana in Milan, written between 1496 and 1498, and there is the wider spread printed version from Venice, which appeared only in 1509, that is, about ten years later. A recent book, ‘Antologia della Divina Proporzione’ unites images from all three editions and allows comparing them easily by presenting similar illustrations on opposing pages (see [1]). Not surprisingly, the colour and printed images are each other’s reflections about a vertical axis (in most cases) and thus we will represent them here often with an additional reflection about the vertical axis, to make the comparison easier. The present paper focuses on observations based on the comparison of the different version. This is not straightforward: for instance, the colour plates are not always as accurate as the black and white ones, or vice versa. Still, the present approach is rather modest, as we avoid interpretations and historic questions, which we leave to art historians.
    [Show full text]
  • A Polyhedral Byway
    BRIDGES Mathematical Connections in Art, Music, and Science A Polyhedral Byway Paul Gailiunas 25 Hedley Terrace, Gosforth Newcastle, NE3 IDP, England [email protected] Abstract An investigation to find polyhedra having faces that include only regular polygons along with a particular concave equilateral pentagon reveals several visually interesting forms. Less well-known aspects of the geometry of some polyhedra are used to generate examples, and some unexpected relationships explored. The Inverted Dodecahedron A regular dodecahedron can be seen as a cube that has roofs constructed on each of its faces in such a way that roof faces join together in pairs to form regular pentagons (Figure 1). Turn the roofs over, so that they point into the cube, and the pairs of roof faces now overlap. The part of the cube that is not occupied by the roofs is a polyhedron, and its faces are the non-overlapping parts of the roof faces, a concave equilateral pentagon (Ounsted[I]), referred to throughout as the concave pentagon. Figure 1: An inverted dodecahedron made from a regular dodecahedron. Are there more polyhedra that have faces that are concave pentagons? Without further restrictions this question is trivial: any polyhedron with pentagonal faces can be distorted so that the pentagons become concave (although further changes may be needed). A further requirement that all other faces should be regular reduces the possibilities, and we can also exclude those with intersecting faces. This still allows an enormous range of polyhedra, and no attempt will be made to classify them all. Instead a few with particularly interesting properties will be explored in some detail.
    [Show full text]
  • Pi Mu Epsilon MAA Student Chapters
    Pi Mu Epsilon Pi Mu Epsilon is a national mathematics honor society with 391 chapters throughout the nation. Established in 1914, Pi Mu Epsilon is a non-secret organization whose purpose is the promotion of scholarly activity in mathematics among students in academic institutions. It seeks to do this by electing members on an honorary basis according to their proficiency in mathematics and by engaging in activities designed to provide for the mathematical and scholarly development of its members. Pi Mu Epsilon regularly engages students in scholarly activity through its Journal which has published student and faculty articles since 1949. Pi Mu Epsilon encourages scholarly activity in its chapters with grants to support mathematics contests and regional meetings established by the chapters and through its Lectureship program that funds Councillors to visit chapters. Since 1952, Pi Mu Epsilon has been holding its annual National Meeting with sessions for student papers in conjunction with the summer meetings of the Mathematical Association of America (MAA). MAA Student Chapters The MAA Student Chapters program was launched in January 1989 to encourage students to con- tinue study in the mathematical sciences, provide opportunities to meet with other students in- terested in mathematics at national meetings, and provide career information in the mathematical sciences. The primary criterion for membership in an MAA Student Chapter is “interest in the mathematical sciences.” Currently there are approximately 550 Student Chapters on college and university campuses nationwide. Schedule of Student Activities Unless otherwise noted, all events are held at the Hyatt Regency Columbus. Wednesday, August 3 Time: Event: Location: 2:00 pm – 4:30 pm CUSAC Meeting .
    [Show full text]
  • Associating Finite Groups to Dessins D' Enfants
    Associating Finite Groups to Dessins D’ Enfants Katrina Biele, Yuan Feng, David Heras, Ahmed Tadde Department of Mathematics, Purdue University. Objective Mathematical Section Discussion • Overarching Research Interest: • Theorem ( Felix Klein) : if G is a finite subgroup of Aut(P), then G is isomorphic to one of the five types of groups: Zn, Dn, A4, A5, S4. • Can we find the Belyi maps of all the Johnson solids via Given a loopless, connected, planar, bipartite graph Γ, use • Theorem (Riemann’s Existence Theorem) : For any hypermap, the corresponding Belyi function exists and is unique to a linear fractional their symmetry group G? properties of the associated symmetry group G to construct a Belyi transfromation of the variable z. This approach should work for most of the Johnson solids. Some of the 1 1 map β : P (C) → P (C) such that Γ arises as its Dessin D’Enfants • We represent a given solid as a hypermap and, subsequently, as a reduced hypermap via the associated symmetry group G. Johnson solids have a complexe engineering, which makes it hard to • Current Research Project: • We compute the Belyi function β0 of the reduced hypermap[2]: determine the solid’s corresponding hypermap. The hypermap is the Finding Belyi maps in order to realize all the Johnson solids as 0 most essential part of this approach. Once the hypermap is determined, 1 The "Black" vertices must be the roots of the function β . The multiplicities of each root must match the corresponding vertex’s order. Consider a Dessins d’Enfants. hypermap Γ with |B| = 5 vertices with degrees {3, 3, 2, 2, 2}, the numerator of β0 can be written in the form (w2 + aw + b)3 (w3 + cw2 + dw + e)2 the reduced-hypermap can be easily deduced and associated with a 0 Belyi map.
    [Show full text]
  • Associating Finite Groups with Dessins D'enfants
    Introduction and Definitions Dessins d'Enfants Past Work Current Progress Associating Finite Groups with Dessins d'Enfants Luis Baeza Edwin Baeza Conner Lawrence Chenkai Wang Edray Herber Goins, Research Mentor Kevin Mugo, Graduate Assistant Purdue Research in Mathematics Experience Department of Mathematics Purdue University August 8, 2014 Purdue Research in Mathematics Experience Associating Finite Groups with Dessins d'Enfants Introduction and Definitions Dessins d'Enfants Past Work Current Progress Outline of Talk 1 Introduction and Definitions Utilities Problem Riemann Surfaces Finite Automorphism Groups of The Sphere Bely˘ı’sTheorem 2 Dessins d'Enfants Esquisse d'un Programme Passports Riemann's Existence Theorem Platonic Solids 3 Past Work Work of Magot and Zvonkin Archimedean and Catalan Solids Johnson Solids 2013 PRiME 4 Current Progress Approach Johnson Solids with Cyclic Symmetry Johnson Solids with Dihedral Symmetry Future Work Purdue Research in Mathematics Experience Associating Finite Groups with Dessins d'Enfants Introduction and Definitions Utilities Problem Dessins d'Enfants Riemann Surfaces Past Work Finite Automorphism Groups of The Sphere Current Progress Bely˘ı’sTheorem Utilities Problem Question Suppose there are three cottages, and each needs to be connected to the gas, water, and electric companies. Using a third dimension or sending any of the connections through another company or cottage are disallowed. Is there a way to make all nine connections without any of the lines crossing each other? Purdue Research in Mathematics Experience Associating Finite Groups with Dessins d'Enfants Introduction and Definitions Utilities Problem Dessins d'Enfants Riemann Surfaces Past Work Finite Automorphism Groups of The Sphere Current Progress Bely˘ı’sTheorem Graphs A (finite) graph is an ordered pair V ; E consisting of vertices V and edges E.
    [Show full text]
  • Polyhedra VEF
    Polyhedra KEY Polyhedra (Polyhedron, singular) are 3-D objects with faces that are polygons. Doing math is just like paradise. ☺ (F) Faces are the flat smooth surfaces. The faces are 2-D polygons. (E) Edges are where two faces meet. (V) Vertices are the “points” where edges meet. NOTE: Remember to keep the vocabulary straight for our formulas! For example, a “six-sided die” is considered to be a cube with 6 faces , NOT 6 sides! We will now introduce a new vocabulary phrase “ sides of faces ”. This is different from a “Face” or from an “Edge”. When viewing a polygon face, think of it as a 2-D object. Therefore, we can view the sides of the polygon as “sides of faces”. “Side of a face” is different than an “Edge” since an “Edge” is a 3-D label. In fact, each “Edge” is composed of two “sides of faces” because each edge is where two faces meet. If we go around a polyhedron and count the total number of “sides of faces” from all of its polygon faces, then we have in fact counted all of the edges of the polyhedron twice! This gives us the following formula: Total Sides of Faces = 2E . Together with Euler’s famous formula for polyhedra, V – E + F = 2 , we are able to determine the number of edges and vertices of any polyhedron just by knowing the number and type of polygon faces that it has. NOTE: we consider only convex polyhedra. 1 Polyhedra KEY Total Sides of Faces = 2E V – E + F = 2 1.
    [Show full text]
  • Centrally Symmetric Convex Polyhedra with Regular Polygonal Faces 1
    MATHEMATICAL COMMUNICATIONS 429 Math. Commun. 18(2013), 429{440 Centrally symmetric convex polyhedra with regular polygonal faces Jurij Kovicˇ1,∗ 1 Institute of Mathematics, Physics and Mechanics, University of Ljubljana, Jadranska 19, SL-1 000 Ljubljana, Slovenia Received April 3, 2013; accepted June 23, 2013 Abstract. First we prove that the class CI of centrally symmetric convex polyhedra with regular polygonal faces consists of 4 of the 5 Platonic, 9 of the 13 Archimedean, 13 of the 92 Johnson solids and two infinite families of 2n-prisms and (2n + 1)-antiprisms. Then we show how the presented maps of their halves (obtained by identification of all pairs of antipodal points) in the projective plane can be used for obtaining their flag graphs and symmetry-type graphs. Finally, we study some linear dependence relations between polyhedra of the class CI . AMS subject classifications: 37F20, 57M10 Key words: map, Platonic solid, Archimedean solid, Johnson solid, flag graph, convex polyhedron, projective plane 1. Introduction Any centrally symmetric convex (hence: spherical) polyhedron C admits identifi- cation of pairs of antipodal points x and x∗; thus the map (i.e. embedding of a graph in a compact surface) of its half C=2 = C=x≡x∗ has the Euler characteristic E = v − e + f = 1 (where v, e and f are the numbers of the vertices, edges and faces of the map, respectively) and can be drawn in a projective plane (represented as a disc with identified antipodal points [8]). Thus the flag graph of C=2 can be easily constructed in the projective plane, too, while the flag graph of C is exactly a 2-sheet cover space [1, 2] over C=2.
    [Show full text]
  • Convex Segmentochora
    Convex Segmentochora Dr. Richard Klitzing [email protected] updated version (June 2015) of preprint (August 2001), published in: Symmetry: Culture and Science, Vol. 11, Nos. 1-4, 139-181, 2000 Abstract Polytopes with all vertices both (A) on a (hyper-) sphere and (B) on a pair of parallel (hyper-) planes, and further (C) with all edges of equal length I will call segmentotopes. Moreover, in dimensions 2, 3 and 4 names like segmentogon, segmentohedron, and segmentochoron could be used. In this article the convex segmentotopes up to dimension 4 are listed. 1 Introduction About 150 years of highdimensional research on polytopes have passed. The regular ones are well-known since those days: in 1852 L. Schlaefli completed his monograph on polyschemes. About 20 years after N. Johnson in 1966 had published the set of convex polyhedra with regular faces, Mrs. R. Blind had done the corresponding research in higher dimensions for polytopes with regular facets. The convex uniform ones of dimension 4 are readily listed on the website http://member.aol.com/_ht_b/Polycell/uniform.html1, and the complete list of all uniform ones of dimension 4 is still ongoing (J. Bowers and G. Olshevsky). Sure, polychora, i.e. polytopes of dimension 4, are not so easy to visualize. This is especially due to the fact that for this attempt the 4th dimension has to be projected somehow into the span of the other 3 directions. One possibility, to do this, works rather well for figures with just one edge length. It shows the 4th dimension as a contraction.
    [Show full text]
  • Convex Polyhedra with Regular Faces
    CONVEX POLYHEDRA WITH REGULAR FACES NORMAN W. JOHNSON 1. Introduction. An interesting set of geometric figures is composed of the convex polyhedra in Euclidean 3-space whose faces are regular polygons (not necessarily all of the same kind). A polyhedron with regular faces is uniform if it has symmetry operations taking a given vertex into each of the other vertices in turn (5, p. 402). If in addition all the faces are alike, the polyhedron is regular. That there are just five convex regular polyhedra—the so-called Platonic solids—was proved by Euclid in the thirteenth book of the Elements (10, pp. 467-509). Archimedes is supposed to have described thirteen other uniform, "semi-regular" polyhedra, but his work on the subject has been lost. Kepler (12, pp. 114-127) showed that the convex uniform polyhedra consist of the Platonic and Archimedean solids together with two infinite families—the regular prisms and antiprisms. It was Kepler also who gave the Archimedean polyhedra their generally accepted names. It is fairly easy to show that there are only a finite number of non-uniform regular-faced polyhedra (11; 13), but it is no simple matter to establish the exact number. However, it appears that there are just ninety-two such solids. Some special cases were discussed by Freudenthal and van der Waerden (8), and a more general treatment was attempted by Zalgaller (13). Subsequently, Zalgaller et al. (14) determined all the regular-faced polyhedra having one or more trivalent vertices and all those having only pentavalent vertices. Griin- baum and Johnson (9) proved that the only kinds of faces that a regular-faced solid, other than a prism or an antiprism, may have are triangles, squares, pentagons, hexagons, octagons, and decagons.
    [Show full text]