On Infinite Kepler-Poinsot Polyhedra Abstract
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Symmetry of Fulleroids Stanislav Jendrol’, František Kardoš
Symmetry of Fulleroids Stanislav Jendrol’, František Kardoš To cite this version: Stanislav Jendrol’, František Kardoš. Symmetry of Fulleroids. Klaus D. Sattler. Handbook of Nanophysics: Clusters and Fullerenes, CRC Press, pp.28-1 - 28-13, 2010, 9781420075557. hal- 00966781 HAL Id: hal-00966781 https://hal.archives-ouvertes.fr/hal-00966781 Submitted on 27 Mar 2014 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. Symmetry of Fulleroids Stanislav Jendrol’ and Frantiˇsek Kardoˇs Institute of Mathematics, Faculty of Science, P. J. Saf´arikˇ University, Koˇsice Jesenn´a5, 041 54 Koˇsice, Slovakia +421 908 175 621; +421 904 321 185 [email protected]; [email protected] Contents 1 Symmetry of Fulleroids 2 1.1 Convexpolyhedraandplanargraphs . .... 3 1.2 Polyhedral symmetries and graph automorphisms . ........ 4 1.3 Pointsymmetrygroups. 5 1.4 Localrestrictions ............................... .. 10 1.5 Symmetryoffullerenes . .. 11 1.6 Icosahedralfulleroids . .... 12 1.7 Subgroups of Ih ................................. 15 1.8 Fulleroids with multi-pentagonal faces . ......... 16 1.9 Fulleroids with octahedral, prismatic, or pyramidal symmetry ........ 19 1.10 (5, 7)-fulleroids .................................. 20 1 Chapter 1 Symmetry of Fulleroids One of the important features of the structure of molecules is the presence of symmetry elements. -
Origin of Icosahedral Symmetry in Viruses
Origin of icosahedral symmetry in viruses Roya Zandi†‡, David Reguera†, Robijn F. Bruinsma§, William M. Gelbart†, and Joseph Rudnick§ Departments of †Chemistry and Biochemistry and §Physics and Astronomy, University of California, Los Angeles, CA 90095-1569 Communicated by Howard Reiss, University of California, Los Angeles, CA, August 11, 2004 (received for review February 2, 2004) With few exceptions, the shells (capsids) of sphere-like viruses (11). This problem is in turn related to one posed much earlier have the symmetry of an icosahedron and are composed of coat by Thomson (12), involving the optimal distribution of N proteins (subunits) assembled in special motifs, the T-number mutually repelling points on the surface of a sphere, and to the structures. Although the synthesis of artificial protein cages is a subsequently posed ‘‘covering’’ problem, where one deter- rapidly developing area of materials science, the design criteria for mines the arrangement of N overlapping disks of minimum self-assembled shells that can reproduce the remarkable properties diameter that allow complete coverage of the sphere surface of viral capsids are only beginning to be understood. We present (13). In a similar spirit, a self-assembly phase diagram has been here a minimal model for equilibrium capsid structure, introducing formulated for adhering hard disks (14). These models, which an explicit interaction between protein multimers (capsomers). all deal with identical capsomers, regularly produced capsid Using Monte Carlo simulation we show that the model reproduces symmetries lower than icosahedral. On the other hand, theo- the main structures of viruses in vivo (T-number icosahedra) and retical studies of viral assembly that assume icosahedral sym- important nonicosahedral structures (with octahedral and cubic metry are able to reproduce the CK motifs (15), and, most symmetry) observed in vitro. -
The Cubic Groups
The Cubic Groups Baccalaureate Thesis in Electrical Engineering Author: Supervisor: Sana Zunic Dr. Wolfgang Herfort 0627758 Vienna University of Technology May 13, 2010 Contents 1 Concepts from Algebra 4 1.1 Groups . 4 1.2 Subgroups . 4 1.3 Actions . 5 2 Concepts from Crystallography 6 2.1 Space Groups and their Classification . 6 2.2 Motions in R3 ............................. 8 2.3 Cubic Lattices . 9 2.4 Space Groups with a Cubic Lattice . 10 3 The Octahedral Symmetry Groups 11 3.1 The Elements of O and Oh ..................... 11 3.2 A Presentation of Oh ......................... 14 3.3 The Subgroups of Oh ......................... 14 2 Abstract After introducing basics from (mathematical) crystallography we turn to the description of the octahedral symmetry groups { the symmetry group(s) of a cube. Preface The intention of this account is to provide a description of the octahedral sym- metry groups { symmetry group(s) of the cube. We first give the basic idea (without proofs) of mathematical crystallography, namely that the 219 space groups correspond to the 7 crystal systems. After this we come to describing cubic lattices { such ones that are built from \cubic cells". Finally, among the cubic lattices, we discuss briefly the ones on which O and Oh act. After this we provide lists of the elements and the subgroups of Oh. A presentation of Oh in terms of generators and relations { using the Dynkin diagram B3 is also given. It is our hope that this account is accessible to both { the mathematician and the engineer. The picture on the title page reflects Ha¨uy'sidea of crystal structure [4]. -
Systematics of Atomic Orbital Hybridization of Coordination Polyhedra: Role of F Orbitals
molecules Article Systematics of Atomic Orbital Hybridization of Coordination Polyhedra: Role of f Orbitals R. Bruce King Department of Chemistry, University of Georgia, Athens, GA 30602, USA; [email protected] Academic Editor: Vito Lippolis Received: 4 June 2020; Accepted: 29 June 2020; Published: 8 July 2020 Abstract: The combination of atomic orbitals to form hybrid orbitals of special symmetries can be related to the individual orbital polynomials. Using this approach, 8-orbital cubic hybridization can be shown to be sp3d3f requiring an f orbital, and 12-orbital hexagonal prismatic hybridization can be shown to be sp3d5f2g requiring a g orbital. The twists to convert a cube to a square antiprism and a hexagonal prism to a hexagonal antiprism eliminate the need for the highest nodality orbitals in the resulting hybrids. A trigonal twist of an Oh octahedron into a D3h trigonal prism can involve a gradual change of the pair of d orbitals in the corresponding sp3d2 hybrids. A similar trigonal twist of an Oh cuboctahedron into a D3h anticuboctahedron can likewise involve a gradual change in the three f orbitals in the corresponding sp3d5f3 hybrids. Keywords: coordination polyhedra; hybridization; atomic orbitals; f-block elements 1. Introduction In a series of papers in the 1990s, the author focused on the most favorable coordination polyhedra for sp3dn hybrids, such as those found in transition metal complexes. Such studies included an investigation of distortions from ideal symmetries in relatively symmetrical systems with molecular orbital degeneracies [1] In the ensuing quarter century, interest in actinide chemistry has generated an increasing interest in the involvement of f orbitals in coordination chemistry [2–7]. -
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). -
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. -
On Polyhedra with Transitivity Properties
Discrete Comput Geom 1:195-199 (1986) iSCrete & Computathm~ ~) 1986 Springer-V©rlagometrvNew York Inc. IF On Polyhedra with Transitivity Properties J. M. Wills Mathematics Institute, University of Siegen, Hoelderlinstrasse 3, D-5900 Siegen, FRG Abstract. In a remarkable paper [4] Griinbaum and Shephard stated that there is no polyhedron of genus g > 0, such that its symmetry group acts transitively on its faces. If this condition is slightly weakened, one obtains" some interesting polyhedra with face-transitivity (resp. vertex-transitivity). In recent years several attempts have been/made to find polyhedral analogues for the Platonic solids in the Euclidean 3-space E 3 (cf. [1, 4, 5, 7-14]). By a polyhedron P we mean the union of a finite number of plane polygons in E 3 which form a 2-manifold without boundary and without self-intersections, where, as usual, a plane polygon is a plane set bounded by finitely many line segments. If the plane polygons are disjoint except for their edges, they are called the faces of P. We require adjacent faces to be non-coplanar. The vertices and edges of P are the vertices and edges of the faces of P. The genus of the underlying 2-manifold is the genus of P. A flag of P is a triplet consisting of one vertex, one edge incident with this vertex, and one face containing this edge. If, for given p- 3, q >- 3 all faces of P are p-gons and all vertices q-valent, we say that P is equivelar, i.e., has equal flags (cf. -
The Small Stellated Dodecahedron Code and Friends
Downloaded from http://rsta.royalsocietypublishing.org/ on September 5, 2018 The small stellated dodecahedron code and rsta.royalsocietypublishing.org friends J. Conrad1,C.Chamberland2,N.P.Breuckmann3 and Research B. M. Terhal4,5 Cite this article: Conrad J, Chamberland C, 1JARA Institute for Quantum Information, RWTH Aachen University, Breuckmann NP,Terhal BM. 2018 The small Aachen 52056, Germany stellated dodecahedron code and friends. Phil. 2Institute for Quantum Computing and Department of Physics and Trans. R. Soc. A 376: 20170323. Astronomy, University of Waterloo, Waterloo, Ontario, Canada N2L http://dx.doi.org/10.1098/rsta.2017.0323 3G1 3Department of Physics and Astronomy, University College London, Accepted: 16 March 2018 London WC1E 6BT, UK 4QuTech, Delft University of Technology, PO Box 5046, 2600 GA Delft, One contribution of 17 to a discussion meeting The Netherlands issue ‘Foundations of quantum mechanics and 5Institute for Theoretical Nanoelectronics, Forschungszentrum their impact on contemporary society’. Juelich, 52425 Juelich, Germany Subject Areas: CC, 0000-0003-3239-5783 quantum computing, quantum physics We explore a distance-3 homological CSS quantum Keywords: code, namely the small stellated dodecahedron code, quantum error correction, fault tolerance, for dense storage of quantum information and we compare its performance with the distance-3 surface homological quantum codes code. The data and ancilla qubits of the small stellated dodecahedron code can be located on Author for correspondence: the edges respectively vertices of a small stellated B. M. Terhal dodecahedron, making this code suitable for three- e-mail: [email protected] dimensional connectivity. This code encodes eight logical qubits into 30 physical qubits (plus 22 ancilla qubits for parity check measurements) in contrast with one logical qubit into nine physical qubits (plus eight ancilla qubits) for the surface code. -
Chapter 3: Transformations Groups, Orbits, and Spaces of Orbits
Preprint typeset in JHEP style - HYPER VERSION Chapter 3: Transformations Groups, Orbits, And Spaces Of Orbits Gregory W. Moore Abstract: This chapter focuses on of group actions on spaces, group orbits, and spaces of orbits. Then we discuss mathematical symmetric objects of various kinds. May 3, 2019 -TOC- Contents 1. Introduction 2 2. Definitions and the stabilizer-orbit theorem 2 2.0.1 The stabilizer-orbit theorem 6 2.1 First examples 7 2.1.1 The Case Of 1 + 1 Dimensions 11 3. Action of a topological group on a topological space 14 3.1 Left and right group actions of G on itself 19 4. Spaces of orbits 20 4.1 Simple examples 21 4.2 Fundamental domains 22 4.3 Algebras and double cosets 28 4.4 Orbifolds 28 4.5 Examples of quotients which are not manifolds 29 4.6 When is the quotient of a manifold by an equivalence relation another man- ifold? 33 5. Isometry groups 34 6. Symmetries of regular objects 36 6.1 Symmetries of polygons in the plane 39 3 6.2 Symmetry groups of some regular solids in R 42 6.3 The symmetry group of a baseball 43 7. The symmetries of the platonic solids 44 7.1 The cube (\hexahedron") and octahedron 45 7.2 Tetrahedron 47 7.3 The icosahedron 48 7.4 No more regular polyhedra 50 7.5 Remarks on the platonic solids 50 7.5.1 Mathematics 51 7.5.2 History of Physics 51 7.5.3 Molecular physics 51 7.5.4 Condensed Matter Physics 52 7.5.5 Mathematical Physics 52 7.5.6 Biology 52 7.5.7 Human culture: Architecture, art, music and sports 53 7.6 Regular polytopes in higher dimensions 53 { 1 { 8. -
Isotoxal Star-Shaped Polygonal Voids and Rigid Inclusions in Nonuniform Antiplane Shear fields
Published in International Journal of Solids and Structures 85-86 (2016), 67-75 doi: http://dx.doi.org/10.1016/j.ijsolstr.2016.01.027 Isotoxal star-shaped polygonal voids and rigid inclusions in nonuniform antiplane shear fields. Part I: Formulation and full-field solution F. Dal Corso, S. Shahzad and D. Bigoni DICAM, University of Trento, via Mesiano 77, I-38123 Trento, Italy Abstract An infinite class of nonuniform antiplane shear fields is considered for a linear elastic isotropic space and (non-intersecting) isotoxal star-shaped polygonal voids and rigid inclusions per- turbing these fields are solved. Through the use of the complex potential technique together with the generalized binomial and the multinomial theorems, full-field closed-form solutions are obtained in the conformal plane. The particular (and important) cases of star-shaped cracks and rigid-line inclusions (stiffeners) are also derived. Except for special cases (ad- dressed in Part II), the obtained solutions show singularities at the inclusion corners and at the crack and stiffener ends, where the stress blows-up to infinity, and is therefore detri- mental to strength. It is for this reason that the closed-form determination of the stress field near a sharp inclusion or void is crucial for the design of ultra-resistant composites. Keywords: v-notch, star-shaped crack, stress singularity, stress annihilation, invisibility, conformal mapping, complex variable method. 1 Introduction The investigation of the perturbation induced by an inclusion (a void, or a crack, or a stiff insert) in an ambient stress field loading a linear elastic infinite space is a fundamental problem in solid mechanics, whose importance need not be emphasized. -
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 . -
Are Your Polyhedra the Same As My Polyhedra?
Are Your Polyhedra the Same as My Polyhedra? Branko Gr¨unbaum 1 Introduction “Polyhedron” means different things to different people. There is very little in common between the meaning of the word in topology and in geometry. But even if we confine attention to geometry of the 3-dimensional Euclidean space – as we shall do from now on – “polyhedron” can mean either a solid (as in “Platonic solids”, convex polyhedron, and other contexts), or a surface (such as the polyhedral models constructed from cardboard using “nets”, which were introduced by Albrecht D¨urer [17] in 1525, or, in a more mod- ern version, by Aleksandrov [1]), or the 1-dimensional complex consisting of points (“vertices”) and line-segments (“edges”) organized in a suitable way into polygons (“faces”) subject to certain restrictions (“skeletal polyhedra”, diagrams of which have been presented first by Luca Pacioli [44] in 1498 and attributed to Leonardo da Vinci). The last alternative is the least usual one – but it is close to what seems to be the most useful approach to the theory of general polyhedra. Indeed, it does not restrict faces to be planar, and it makes possible to retrieve the other characterizations in circumstances in which they reasonably apply: If the faces of a “surface” polyhedron are sim- ple polygons, in most cases the polyhedron is unambiguously determined by the boundary circuits of the faces. And if the polyhedron itself is without selfintersections, then the “solid” can be found from the faces. These reasons, as well as some others, seem to warrant the choice of our approach.