DOCSLIB.ORG

6.5 X 11 Threelines.P65

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
6.5 X 11 Threelines.P65 Cambridge University Press 978-0-521-12821-6 - A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics Peter Hilton and Jean Pedersen Index More information Index (2, 1)-folding procedure 44 BAMA (Bay Area Mathematical Adventures) 206 (2, 1)-tape 44 Barbina, Silvia xiii (4, 4)-tape 99 Berkove and Dumont 205 1-period paper-folding 17 Betti number 231 10-gon from D2U 2-tape 50 big guess 279 11-gon 96 bold italics x 12-8-flexagon 16 Borchards, Richard 236 12-celled equatorial collapsoid 184–185 braided cube 117 12-celled polar collapsoid 179–185 braided octahedron 116 16-8-flexagon 16 braided Platonic solids 123, 125 2-period folding procedure 49 braided tetrahedron 115 2-period paper-folding 39 braiding the diagonal cube 129–130 2-symbol 99 braiding the dodecahedron 131–136 20-celled polar collapsoid 182 braiding the golden dodecahedron 129, 131 3-6-flexagon 195 braiding the icosahedron 134–138 3-period folding procedure 97 3-symbol 104 Caradonna, Monika xiii 30-celled collapsoid 183–186 Cartan, Henri 237 6-flexagons 4 Challenger space shuttle 2 6-6 flexagons 7–11 closed orientable manifold 232 8-flexagon 11–16 closed orientable surface 230 9-6 flexagon 9 coach 261 90-celled collapsoid 190 coach theorem 260–263, 264 90-celled collapsoid (more symmetric) 193 coach theorem (cyclic) 271 coach theorem (generalized) 267–271 Abel Prize 236 collapsible cube 194 accidents (in mathematics there are no) 275, 271 collapsoids 38, 175–194 Albers, Don xv collapsoids, equatorial 176 Alexanderson and Wetzel 206 collapsoids, polar 176 Alexanderson, Gerald L. ix, 256 combinatorial invariant 158 alternating group 152, 246, 255 combinatorial threads 206 American Mathematical Monthly 235 commutative 240 American Mathematical Society 257 complementary factor 106–108 Andreas,J.M.95 33 complementary a -gon 263 angular deficiency 154 complete modified symbol 262 angular deficiency (total) 155 complete net 72 Archimedean solids 222 complete symbol 100, 261 Artmann, Beno ix contracted symbol 99 Aumann, Robert 236 convex deltahedra 73, 74 convex polyhedron 82 bad mathematics lecture 259 coset 242 Ball, Rouse 95, 206 Courant and Robbins 152 286 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-12821-6 - A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics Peter Hilton and Jean Pedersen Index More information Index 287 Coxeter 206 Euler characteristic 158, 223, 230 Coxeter, Duval, Flather and Petrie 220 Euler totient function xii Coxeter, H. S. M. 38, 73, 175 Euler’s formula 154 cross-caps (Mobius¨ bands) 231 Euler–Poincare´ characteristic 233 cube 212 even permutation theorem 253 cube (collapsible) 194 extended face planes of the cube 213–214 cube (diagonal) 212 extended face planes of the octahedron 213–215 cube (extended face planes of) 213–214 extended face planes of the tetrahedron 213 cube (symmetries of) 145–149 Cundy 206 facial expressions of the flexagon 204 Cundy and Rollett 206 facts about the Platonic solids 210 cycle 101 facts of life 110, 112 cycle index 249 famous number sequences 105 cycle index theorem 250 FAT 5-gon 31, 31 cyclic coach theorem 271 FAT 7-gon 244 cyclic group 245 FAT 10-gon 49 FAT 17-gon 99 decahedron 81 FAT algorithm 24, 39, 40 definition of a group 239 FAT pentagon 165 deltahedron 73 Fermat number 232 + 1 108 Dennison, Clare xv Fermat number xii, 20, 105, 106 Descartes, Rene´ 154, 229 Fermat prime 20 Descartes’ angular deficiency 154 Fermat, Pierre 106 Descartes’ theorem (dual for) 229 Fermat’s Little Theorem 68 Descartes’ total angular defect 223 Feynman, Richard P. 2 diagonal cube (braiding) 129–130 Fibonacci number(s) 54, 105, 237 diagonal cube 125, 126, 212 Fields Medal 236 dihedral group 245 flexagon 3–16 dipyramid 86, 160 flexagon (facial expressions of) 204 divisions of the plane 206 flexing down 200 dodecadeltahedron 75 flexing up 198 dodecahedron 81, 123, 164 fold total 102 dodecahedron (braiding) 131–136 folding numbers 56 dodecahedron (ghost of) 221 D2U 1-folding procedure 43 dodecahedron (golden) 212 folding numbers written in base 10 57 dodecahedron (great stellated) 164, 168–174 folding numbers written in base t 56 dodecahedron (great) 164, 171–172 function (symmetric) 236 dodecahedron (offspring of) 143 dodecahedron (rhombic) 175, 176 Garcia, Victor xiii dodecahedron (small stellated) 164–173 Gardner, Martin 2 dodecahedron (stellations of) 219 Gauss xiii dodecahexaflexagon 10 generalized coach theorem 267–271 dodecaoctaflexagon 16 generalized quasi-order theorem 264–267 Donmoyer, Sylvie xi genus 231 double torus 231 geometrical error 18 dual for Descartes’ theorem 229 ghost of a dodecahedron 221 dual polyhedra (pairs of) 160 Gilbert and Sullivan 3 duals 210 G-invariants 243 Dumont (Berkove and) 205 golden dodecahedron 125, 126, 212 golden dodecahedron (braiding) 129, 131 Eidgenossische¨ Technische Hochschule (ETH) 256 golden ratio 125 entire group 200–202 great dodecahedron 164, 171–172 equatorial collapsoids 176 great stellated dodecahedron 164, 168–174 Erlanger Programm 238 Greeks xiii, 20 Euclid 154 group (alternating) 246 Euclidean algorithm 53 group (cyclic) 245 Euclidean construction 20 group (definition of) 239 Euclidean geometry 238 group (dihedral) 245 Euclidean motions 243 group (entire) 200–202 Euclidean tools 20 group (happy) 197–199 Euler, Leonhard 20, 106, 229 group (infinite) 240 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-12821-6 - A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics Peter Hilton and Jean Pedersen Index More information 288 Index group (order of) 241 magical relationships 173 group (symmetric) 241, 245 Manhattan Project 2 group table (square) 240 MANIAC 2 group theory 238 manifold (closed orientable) 232 group theory and hexaflexagons 195–205 material error 17 group-theoretical threads 206 Mathematical Association of America 257 Grunbaum¨ and Shephard notation 142, 229 Mathematical Discovery 259 Grunbaum,¨ Branko 139 Mathematics Magazine 203 medium-line 9-gon 35 Hall, Philip 1 Mersenne, Abbe´ 105 Handbook of Applicable Mathematics 238 Mersenne number 105 happy group 197–199 Mersenne number 211 − 1 108 Harmonia mundi 214 Mobius¨ bands (cross-caps) 231 Heath, R. V. 95 modified symbol 102, 268, 270 height of a 60 Morrison, Philip 2 heptahedron 81 hexacaidecadeltahedra (rotating ring of) 93–94 Nash, John 236 hexacaidecadeltahedron 75 National Council of Teachers of Mathematics hexacaidecahedron 81 259 hexacaidecaoctaflexagon 16 net 72 hexaflexagons 4 net for hexahedron (cube) 77 hexahedron (cube) 123 net for regular pentagonal dodecahedron 77 hexahedron 81 Nobel Prize 236 hexahexaflexagons 7 Noether, Emmy 233 Hilton, Margaret xv nonahedron 81 homologues 247–252 nonahexaflexagon 9 homology groups 231 non-convex polyhedron 82 Hooper, Jennifer xiii, 14, 16 normal subgroup 203, 255 Hubble Space Telescope 3 Northcott, D. G. 1 Nugent, Mike xv icosahedral symmetry 211 number theory 96 icosahedron 75, 81, 123 number trick 66 icosahedron (braiding) 134–138 icosahedron (offspring of) 143 octaflexagons 11 icosahedron (symmetric) 141 octahedral symmetry 211 in mathematics there are no accidents 275, 271 octahedron (extended face planes of) index 243 213–215 infinite group 240 octahedron (symmetric) 140, 141 invariant 245 octahedron 74, 81, 123 invariant, combinatorial 158 octahedron, regular (symmetries of) invariant, topological 158 149–151 isonemal fabrics in the plane 140 offspring of a dodecahedron 143 isonemal fabrics on polyhedral surfaces 142 offspring of the icosahedron 143 optimistic strategy 43, 46, 96 Jennifer’s puzzle 110–122, 145, 149 order of a group 241 Jones, James H. 3 orientation and symmetry 152 Kepler, Johannes 122, 214 parity 253 Kinsey Report 3 parlor tricks 176, 271 Kinsey, Alfred C. 3 pass-through flex 13–14 Klein, Felix 238, 256, 257 Pedersen home 256 Pedersen, Chris 176, 271 Lagrange, Joseph-Louis 241 Pedersen, Jennifer 112 Lagrange’s theorem 242 Pedersen, Kent xv Ledermann 238 pentacaidecahedron 81 Lefschetz, S. 1 pentacaidecahexaflexagon 10 Logothetti, Dave 225 pentagon (FAT) 165 long-line 5-gon 30 pentagon (long-line) 165 long-line 9-gon 34 pentagon (short-line) 165 long-line pentagon 165 pentagonal dipyramid 74, 86–88, 247 Lucas number 54, 105, 238 pentagram(s) 164 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-12821-6 - A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics Peter Hilton and Jean Pedersen Index More information Index 289 pentahedron 81 short-line 9-gon 35 period 46 short-line pentagon 165 permutation 101 Siamese dodecahedron 73 permutation group S4 149 simplexes 234 Platonic solids xiii, 80, 84, 85, 206, 211 small stellated dodecahedron 164–173 Platonic solids (braided) 123, 125 Spitzer, Lyman, Jr. 3 Platonic solids (fact about) 210 square group table 240 Poincare´ polynomial 235 Stalker, R. M. 95 polar collapsoids 176 stella octangula 121, 122, 214 Polya´ 206 stellations of the dodecahedron 219 Polya´ enumeration theorem 248–250 Stone, Arthur H. 1–3 Polya,´ George 154, 256, 259 straight flex 13 Polya,´ Stella 256 subgroup 241 Polya’s´ dream 223–225 super symmetry 236 polygon 80 surface (closed orientable) 230 polygonal region 80 symbol (2-) 99 polyhedra, self-dual 161 symbol (complete modified) 262 polyhedron and its dual 160 symbol (complete) 100, 261 Preston, Dawn xv symbol (contracted) 99 primary crease lines 44 symbol (modified) 102, 268, 270 primary folding procedure of period 3 99 symbol (reduced) 99 prime section 58 symmetric
Load more

Recommended publications
  • Descartes, Euler, Poincaré, Pólya and Polyhedra Séminaire De Philosophie Et Mathématiques, 1982, Fascicule 8 « Descartes, Euler, Poincaré, Polya and Polyhedra », , P
    Séminaire de philosophie et mathématiques PETER HILTON JEAN PEDERSEN Descartes, Euler, Poincaré, Pólya and Polyhedra Séminaire de Philosophie et Mathématiques, 1982, fascicule 8 « Descartes, Euler, Poincaré, Polya and Polyhedra », , p. 1-17 <http://www.numdam.org/item?id=SPHM_1982___8_A1_0> © École normale supérieure – IREM Paris Nord – École centrale des arts et manufactures, 1982, tous droits réservés. L’accès aux archives de la série « Séminaire de philosophie et mathématiques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ - 1 - DESCARTES, EULER, POINCARÉ, PÓLYA—AND POLYHEDRA by Peter H i l t o n and Jean P e d e rs e n 1. Introduction When geometers talk of polyhedra, they restrict themselves to configurations, made up of vertices. edqes and faces, embedded in three-dimensional Euclidean space. Indeed. their polyhedra are always homeomorphic to thè two- dimensional sphere S1. Here we adopt thè topologists* terminology, wherein dimension is a topological invariant, intrinsic to thè configuration. and not a property of thè ambient space in which thè configuration is located. Thus S 2 is thè surface of thè 3-dimensional ball; and so we find. among thè geometers' polyhedra. thè five Platonic “solids”, together with many other examples. However. we should emphasize that we do not here think of a Platonic “solid” as a solid : we have in mind thè bounding surface of thè solid.
    [Show full text]
  • 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]
  • Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur Si Muove: Biomimetic Embedding of N-Tuple Helices in Spherical Polyhedra - /
    Alternative view of segmented documents via Kairos 23 October 2017 | Draft Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur si muove: Biomimetic embedding of N-tuple helices in spherical polyhedra - / - Introduction Symbolic stars vs Strategic pillars; Polyhedra vs Helices; Logic vs Comprehension? Dynamic bonding patterns in n-tuple helices engendering n-fold rotating symbols Embedding the triple helix in a spherical octahedron Embedding the quadruple helix in a spherical cube Embedding the quintuple helix in a spherical dodecahedron and a Pentagramma Mirificum Embedding six-fold, eight-fold and ten-fold helices in appropriately encircled polyhedra Embedding twelve-fold, eleven-fold, nine-fold and seven-fold helices in appropriately encircled polyhedra Neglected recognition of logical patterns -- especially of opposition Dynamic relationship between polyhedra engendered by circles -- variously implying forms of unity Symbol rotation as dynamic essential to engaging with value-inversion References Introduction The contrast to the geocentric model of the solar system was framed by the Italian mathematician, physicist and philosopher Galileo Galilei (1564-1642). His much-cited phrase, " And yet it moves" (E pur si muove or Eppur si muove) was allegedly pronounced in 1633 when he was forced to recant his claims that the Earth moves around the immovable Sun rather than the converse -- known as the Galileo affair. Such a shift in perspective might usefully inspire the recognition that the stasis attributed so widely to logos and other much-valued cultural and heraldic symbols obscures the manner in which they imply a fundamental cognitive dynamic. Cultural symbols fundamental to the identity of a group might then be understood as variously moving and transforming in ways which currently elude comprehension.
    [Show full text]
  • Polyhedral Surfaces, Discrete Curvatures, Shape Analysis, 3D Modelling, Segmentation
    JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 9/2005, ISSN 1642-6037 polyhedral surfaces, discrete curvatures, shape analysis, 3D modelling, segmentation. Alexandra BAC, Marc DANIEL, Jean-Louis MALTRET* 3D MODELLING AND SEGMENTATION WITH DISCRETE CURVATURES Recent concepts of discrete curvatures are very important for Medical and Computer Aided Geometric Design applications. A first reason is the opportunity to handle a discretisation of a continuous object, with a free choice of the discretisation. A second and most important reason is the possibility to define second-order estimators for discrete objects in order to estimate local shapes and manipulate discrete objects. There is an increasing need to handle polyhedral objects and clouds of points for which only a discrete approach makes sense. These sets of points, once structured (in general meshed with simplexes for surfaces or volumes), can be analysed using these second-order estimators. After a general presentation of the problem, a first approach based on angular defect, is studied. Then, a local approximation approach (mostly by quadrics) is presented. Different possible applications of these techniques are suggested, including the analysis of 2D or 3D images, decimation, segmentation... We finally emphasise different artefacts encountered in the discrete case. 1. INTRODUCTION This paper offers a review of work on discrete curvatures for Computer Aided Geometric Design applications and a discussion about some ideas for further studies. We consider the discrete curvatures computed on a set of points and their relevance to continuous curvatures when the density of the points increases. First of all, it is interesting to recall that curvatures are fundamental tools for studying curves and surfaces.
    [Show full text]
  • Can Every Face of a Polyhedron Have Many Sides ?
    Can Every Face of a Polyhedron Have Many Sides ? Branko Grünbaum Dedicated to Joe Malkevitch, an old friend and colleague, who was always partial to polyhedra Abstract. The simple question of the title has many different answers, depending on the kinds of faces we are willing to consider, on the types of polyhedra we admit, and on the symmetries we require. Known results and open problems about this topic are presented. The main classes of objects considered here are the following, listed in increasing generality: Faces: convex n-gons, starshaped n-gons, simple n-gons –– for n ≥ 3. Polyhedra (in Euclidean 3-dimensional space): convex polyhedra, starshaped polyhedra, acoptic polyhedra, polyhedra with selfintersections. Symmetry properties of polyhedra P: Isohedron –– all faces of P in one orbit under the group of symmetries of P; monohedron –– all faces of P are mutually congru- ent; ekahedron –– all faces have of P the same number of sides (eka –– Sanskrit for "one"). If the number of sides is k, we shall use (k)-isohedron, (k)-monohedron, and (k)- ekahedron, as appropriate. We shall first describe the results that either can be found in the literature, or ob- tained by slight modifications of these. Then we shall show how two systematic ap- proaches can be used to obtain results that are better –– although in some cases less visu- ally attractive than the old ones. There are many possible combinations of these classes of faces, polyhedra and symmetries, but considerable reductions in their number are possible; we start with one of these, which is well known even if it is hard to give specific references for precisely the assertion of Theorem 1.
    [Show full text]
  • 131 865- EDRS PRICE Technclogy,Liedhanical
    ..DOCUMENT RASH 131 865- JC 760 420 TITLE- Training Program for Teachers of Technical Mathematics in Two-Year Cutricnla. INSTITUTION Queensborough Community Coll., Bayside, N Y. SPONS AGENCY New York State Education Dept., Albany. D v.of Occupational Education Instruction. PUB DATE Jul 76 GRANT VEA-78-2-132 NOTE 180p. EDRS PRICE MP-$0.83 HC-S10.03 Plus Postage. DESCRIPTORS *College Mathematics; Community Colleges; Curriculum Development; Engineering Technology; *Junior Colleges Mathematics Curriculum; *Mathematics Instruction; *Physics Instruction; Practical ,Mathematics Technical Education; *Technical Mathematics Technology ABSTRACT -This handbook 1 is designed'to.aS ist teachers of techhical'mathematics in:developing practically-oriented-curricula -for their students. The upderlying.assumption is that, while technology students are nOt a breed apartr their: needs-and orientation are_to the concrete, rather than the abstract. It describes the:nature, scope,and dontett,of curricula.. in Electrical, TeChnClogy,liedhanical Technology4 Design DraftingTechnology, and: Technical Physics', ..with-particularreterence to:the mathematical skills which are_important for the students,both.incollege.andot -tle job. SaMple mathematical problemsr-derivationSeand.theories tei be stressed it..each of_these.durricula-are presented, as- ate additional materials from the physics an4 mathematics. areas. A frame ok-reference-is.provided through diScussiotS ofthe\careers,for.which-. technology students-are heing- trained'. There.iS alsO &section deioted to
    [Show full text]
  • 900.00 Modelability
    986.310 Strategic Use of Min-max Cosmic System Limits 986.311 The maximum limit set of identical facets into which any system can be divided consists of 120 similar spherical right triangles ACB whose three corners are 60 degrees at A, 90 degrees at C, and 36 degrees at B. Sixty of these right spherical triangles are positive (active), and 60 are negative (passive). (See Sec. 901.) 986.312 These 120 right spherical surface triangles are described by three different central angles of 37.37736814 degrees for arc AB, 31.71747441 degrees for arc BC, and 20.90515745 degrees for arc AC__which three central-angle arcs total exactly 90 degrees. These 120 spherical right triangles are self-patterned into producing 30 identical spherical diamond groups bounded by the same central angles and having corresponding flat-faceted diamond groups consisting of four of the 120 angularly identical (60 positive, 60 negative) triangles. Their three surface corners are 90 degrees at C, 31.71747441 degrees at B, and 58.2825256 degrees at A. (See Fig. 986.502.) 986.313 These diamonds, like all diamonds, are rhombic forms. The 30- symmetrical- diamond system is called the rhombic triacontahedron: its 30 mid- diamond faces (right- angle cross points) are approximately tangent to the unit- vector-radius sphere when the volume of the rhombic triacontahedron is exactly tetravolume-5. (See Fig. 986.314.) 986.314 I therefore asked Robert Grip and Chris Kitrick to prepare a graphic comparison of the various radii and their respective polyhedral profiles of all the symmetric polyhedra of tetravolume 5 (or close to 5) existing within the primitive cosmic hierarchy (Sec.
    [Show full text]
  • Binding Regular Polyhedra
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repository of the Academy's Library Optimal packages: binding regular polyhedra F. Kovacs´ Department of Structural Mechanics Budapest University of Technology and Economics ABSTRACT: Strings on the surface of gift boxes can be modelled as a special kind of cable-and-joint struc- ture. This paper deals with systems composed of idealised (frictionless) closed loops of strings that provide stable binding to the underlying convex polyhedron (‘package’). Optima are searched in both the sense of topology and geometry in finding minimal number of closed loops as well as the minimal (total) length of cables to ensure such a stable binding for simple cases of polyhedra. 1 INTRODUCTION and concave otherwise (for example, ‘zigzag’ loops with alternating turns are concave). In these terms, the 1.1 Loops on a polyhedral surface loop on the left hand side of Fig. 1 is complex due to the self-intersection at the top and concave because of There are some practical occurrences of closed strings the two rectangular turns with different handedness on polyhedral surfaces. For example, mailed pack- at the bottom (such connections will be called self- ages are traditionally bound by some pieces of string. binding from now on); whereas the skew string to the Another example is from basketry, when a woven right is simple and convex (by having no turns within pattern over a polyhedral surface is also formed by the polyhedral surface at all). some (mainly closed) strings (Tarnai, Kov´acs, Fowler, & Guest 2012, Kov´acs 2014).
    [Show full text]
  • Parity Check Schedules for Hyperbolic Surface Codes
    Parity Check Schedules for Hyperbolic Surface Codes Jonathan Conrad September 18, 2017 Bachelor thesis under supervision of Prof. Dr. Barbara M. Terhal The present work was submitted to the Institute for Quantum Information Faculty of Mathematics, Computer Science und Natural Sciences - Faculty 1 First reviewer Second reviewer Prof. Dr. B. M. Terhal Prof. Dr. F. Hassler Acknowledgements Foremost, I would like to express my gratitude to Prof. Dr. Barbara M. Terhal for giving me the opportunity to complete this thesis under her guidance, insightful discussions and her helpful advice. I would like to give my sincere thanks to Dr. Nikolas P. Breuckmann for his patience with all my questions and his good advice. Further, I would also like to thank Dr. Kasper Duivenvoorden and Christophe Vuillot for many interesting and helpful discussions. In general, I would like to thank the IQI for its hospitality and everyone in it for making my stay a very joyful experience. As always, I am grateful for the constant support of my family and friends. Table of Contents 1 Introduction 1 2 Preliminaries 2 3 Stabilizer Codes 5 3.1 Errors . 6 3.2 TheBitFlipCode ............................... 6 3.3 The Toric Code . 11 4 Homological Code Construction 15 4.1 Z2-Homology .................................. 18 5 Hyperbolic Surface Codes 21 5.1 The Gauss-Bonnet Theorem . 21 5.2 The Small Stellated Dodecahedron as a Hyperbolic Surface Code . 26 6 Parity Check Scheduling 32 6.1 Seperate Scheduling . 33 6.2 Interleaved Scheduling . 39 6.3 Coloring the Small Stellated Dodecahedron . 45 7 Fault Tolerant Quantum Computation 47 7.1 Fault Tolerance .
    [Show full text]
  • Winter Break "Homework Zero"
    \HOMEWORK 0" Last updated Friday 27th December, 2019 at 2:44am. (Not officially to be turned in) Try your best for the following. Using the first half of Shurman's text is a good start. I will possibly add some notes to supplement this. There are also some geometric puzzles below for you to think about. Suggested winter break homework - Learn the proof to Cauchy-Schwarz inequality. - Find out what open sets, closed sets, compact set (closed and bounded in Rn, as well as the definition with open covering cf. Heine-Borel theorem), and connected set means in Rn. - Find out what supremum (least upper bound) and infimum (greatest lower bound) of a subset of real numbers mean. - Find out what it means for a sequence and series to converge. - Find out what does it mean for a function f : Rn ! Rm to be continuous. There are three equivalent characterizations: (1) Limit preserving definition. (2) Inverse image of open sets are open. (3) −δ definition. - Find the statements to extreme value theorem, intermediate value theorem, and mean value theorem. - Find out what is the fundamental theorem of calculus. - Find out how to perform matrix multiplication, computation of matrix inverse, and matrix deter- minant. - Find out what is the geometric meaning of matrix determinantDecember, 2019 . - Find out how to solve a linear system of equation using row reduction. n m - Find out what a linear map from R to R is, and what is its relationth to matrix multiplication by an m × n matrix. How is matrix product related to composition of linear maps? - Find out what it means to be differentiable at a point a for a multivariate function, what is the derivative of such function at a, and how to compute it.
    [Show full text]
  • Polyhedral Models of the Projective Plane
    Bridges 2018 Conference Proceedings Polyhedral Models of the Projective Plane Paul Gailiunas 25 Hedley Terrace, Gosforth, Newcastle, NE3 1DP, England; [email protected] Abstract The tetrahemihexahedron is the only uniform polyhedron that is topologically equivalent to the projective plane. Many other polyhedra having the same topology can be constructed by relaxing the conditions, for example those with faces that are regular polygons but not transitive on the vertices, those with planar faces that are not regular, those with faces that are congruent but non-planar, and so on. Various techniques for generating physical realisations of such polyhedra are discussed, and several examples of different types described. Artists such as Max Bill have explored non-orientable surfaces, in particular the Möbius strip, and Carlo Séquin has considered what is possible with some models of the projective plane. The models described here extend the range of possibilities. The Tetrahemihexahedron A two-dimensional projective geometry is characterised by the pair of axioms: any two distinct points determine a unique line; any two distinct lines determine a unique point. There are projective geometries with a finite number of points/lines but more usually the projective plane is considered as an ordinary Euclidean plane plus a line “at infinity”. By the second axiom any line intersects the line “at infinity” in a single point, so a model of the projective plane can be constructed by taking a topological disc (it is convenient to think of it as a hemisphere) and identifying opposite points. The first known analytical surface matching this construction was discovered by Jakob Steiner in 1844 when he was in Rome, and it is known as the Steiner Roman surface.
    [Show full text]
  • 41 Three Dimensional Shapes
    41 Three Dimensional Shapes Space figures are the first shapes children perceive in their environment. In elementary school, children learn about the most basic classes of space fig- ures such as prisms, pyramids, cylinders, cones and spheres. This section concerns the definitions of these space figures and their properties. Planes and Lines in Space As a basis for studying space figures, first consider relationships among lines and planes in space. These relationships are helpful in analyzing and defining space figures. Two planes in space are either parallel as in Figure 41.1(a) or intersect as in Figure 41.1(b). Figure 41.1 The angle formed by two intersecting planes is called the dihedral angle. It is measured by measuring an angle whose sides line in the planes and are perpendicular to the line of intersection of the planes as shown in Figure 41.2. Figure 41.2 Some examples of dihedral angles and their measures are shown in Figure 41.3. 1 Figure 41.3 Two nonintersecting lines in space are parallel if they belong to a common plane. Two nonintersecting lines that do not belong to the same plane are called skew lines. If a line does not intersect a plane then it is said to be parallel to the plane. A line is said to be perpendicular to a plane at a point A if every line in the plane through A intersects the line at a right angle. Figures illustrating these terms are shown in Figure 41.4. Figure 41.4 Polyhedra To define a polyhedron, we need the terms ”simple closed surface” and ”polygonal region.” By a simple closed surface we mean any surface with- out holes and that encloses a hollow region-its interior.
    [Show full text]