Detc2020-17855
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Semi-Regular Tilings of the Hyperbolic Plane
SEMI-REGULAR TILINGS OF THE HYPERBOLIC PLANE BASUDEB DATTA AND SUBHOJOY GUPTA Abstract. A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons surrounding the vertex. We determine combinatorial criteria for the existence, and uniqueness, of a semi-regular tiling with a given vertex-type, and pose some open questions. 1. Introduction A tiling of a surface is a partition into (topological) polygons (the tiles) which are non- overlapping (interiors are disjoint) and such that tiles which touch, do so either at exactly one vertex, or along exactly one common edge. The vertex-type of a vertex v is a cyclic tuple of integers [k1; k2;:::; kd] where d is the degree (or valence) of v, and each ki (for 1 i d) is the number of sides (the size) of the i-th polygon around v, in either clockwise or≤ counter-clockwise≤ order. A semi-regular tiling on a surface of constant curvature (eg., the round sphere, the Euclidean plane or the hyperbolic plane) is one in which each polygon is regular, each edge is a geodesic, and the vertex-type is identical for each vertex (see Figure 1). Two tilings are equivalent if they are combinatorially isomorphic, that is, there is a homeomorphism of the surface to itself that takes vertices, edges and tiles of one tiling to those of the other. In fact, two semi-regular tilings of the hyperbolic plane are equivalent if and only if there is an isometry of the hyperbolic plane that realizes the combinatorial isomorphism between them (see Lemma 2.5). -
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. -
Tiling the Plane with Equilateral Convex Pentagons Maria Fischer1
Parabola Volume 52, Issue 3 (2016) Tiling the plane with equilateral convex pentagons Maria Fischer1 Mathematicians and non-mathematicians have been concerned with finding pentago- nal tilings for almost 100 years, yet tiling the plane with convex pentagons remains the only unsolved problem when it comes to monohedral polygonal tiling of the plane. One of the oldest and most well known pentagonal tilings is the Cairo tiling shown below. It can be found in the streets of Cairo, hence the name, and in many Islamic decorations. Figure 1: Cairo tiling There have been 15 types of such pentagons found so far, but it is not clear whether this is the complete list. We will look at the properties of these 15 types and then find a complete list of equilateral convex pentagons which tile the plane – a problem which has been solved by Hirschhorn in 1983. 1Maria Fischer completed her Master of Mathematics at UNSW Australia in 2016. 1 Archimedean/Semi-regular tessellation An Archimedean or semi-regular tessellation is a regular tessellation of the plane by two or more convex regular polygons such that the same polygons in the same order surround each polygon. All of these polygons have the same side length. There are eight such tessellations in the plane: # 1 # 2 # 3 # 4 # 5 # 6 # 7 # 8 Number 5 and number 7 involve triangles and squares, number 1 and number 8 in- volve triangles and hexagons, number 2 involves squares and octagons, number 3 tri- angles and dodecagons, number 4 involves triangles, squares and hexagons and num- ber 6 squares, hexagons and dodecagons. -
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. -
Dispersion Relations of Periodic Quantum Graphs Associated with Archimedean Tilings (I)
Dispersion relations of periodic quantum graphs associated with Archimedean tilings (I) Yu-Chen Luo1, Eduardo O. Jatulan1,2, and Chun-Kong Law1 1 Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan 80424. Email: [email protected] 2 Institute of Mathematical Sciences and Physics, University of the Philippines Los Banos, Philippines 4031. Email: [email protected] January 15, 2019 Abstract There are totally 11 kinds of Archimedean tiling for the plane. Applying the Floquet-Bloch theory, we derive the dispersion relations of the periodic quantum graphs associated with a number of Archimedean tiling, namely the triangular tiling (36), the elongated triangular tiling (33; 42), the trihexagonal tiling (3; 6; 3; 6) and the truncated square tiling (4; 82). The derivation makes use of characteristic functions, with the help of the symbolic software Mathematica. The resulting dispersion relations are surpris- ingly simple and symmetric. They show that in each case the spectrum is composed arXiv:1809.09581v2 [math.SP] 12 Jan 2019 of point spectrum and an absolutely continuous spectrum. We further analyzed on the structure of the absolutely continuous spectra. Our work is motivated by the studies on the periodic quantum graphs associated with hexagonal tiling in [13] and [11]. Keywords: characteristic functions, Floquet-Bloch theory, quantum graphs, uniform tiling, dispersion relation. 1 1 Introduction Recently there have been a lot of studies on quantum graphs, which is essentially the spectral problem of a one-dimensional Schr¨odinger operator acting on the edge of a graph, while the functions have to satisfy some boundary conditions as well as vertex conditions which are usually the continuity and Kirchhoff conditions. -
Supporting Information for Harnessing Instabilities for Design of Soft Reconfigurable Auxetic/Chiral Materials
Electronic Supplementary Material (ESI) for Soft Matter This journal is © The Royal Society of Chemistry 2013 Supporting Information for Harnessing instabilities for design of soft reconfigurable auxetic/chiral materials Jongmin Shim,1, 2 Sicong Shan,3, 2 Andrej Koˇsmrlj,4 Sung H. Kang,3 Elizabeth R. Chen,3 James C. Weaver,5 and Katia Bertoldi3, 6 1Department of Civil, Structural and Environmental Engineering, University at Buffalo, NY, 14260, USA 2J.S. and S.S. contributed equally to this work 3School of Engineering and Applied Sciences, Harvard University, Cambridge, Massachusetts 02138, USA 4Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA 5Wyss Institute for Biologically Inspired Engineering, Harvard University, Cambridge, Massachusetts 02138, USA 6Kavli Institute, Harvard University, Cambridge, Massachusetts 02138, USA ANALYSIS - DESIGN PRINCIPLES From tilings of the 2D Euclidean plane to porous structures To identify possible periodic monodisperse circular hole arrangements in elastic plates where buckling can be exploited as a mechanism to reversibly switch between undeformed/expanded and deformed/compact configur- ations, we investigate the hole arrangements by consider- ing geometric constraints on the tilings (i.e., tessellations) of the 2D Euclidean plane. In order for all the monodisperse circular holes to close through buckling of the ligaments, the plates should meet the following requirements: (a) the center-to-center dis- tances of adjacent holes are identical, so that all the lig- aments are characterized by the same minimum width and undergo the first buckling mode in an approxim- ately uniform manner; (b) there is an even number of ligaments around every hole, so that the deformation induced by buckling leads to their closure. -
Polyhedra “There Is Geometry in the Humming of Strings, There Is Music in the Spacing of the Spheres.” - Pythagoras
Polyhedra “There is geometry in the humming of strings, there is music in the spacing of the spheres.” - Pythagoras Math 110 Math Applications Art, Fall 2018 A Quick Review of Polygons Edge • A closed, connected chain of (straight) line segments. Face The line segments are called edges or sides • Vertex • The points where two segments meet are called vertices, nodes, or corners Interior Angle • The area surrounded by the segments is called the face • The path created by the sides is called the Below are NOT polygons: boundary or perimeter • An interior angle is measured within the face, and is formed by two sides Sides not straight Not connected Not closed Math 110 Math Applications Art, Fall 2018 Classifying Polygons • Polygons are named for the number of sides they have: triangle/trigon (3), quadrilateral (4), pentagon (5), hexagon (6), etc. • An n-gon is a polygon with n sides • If all edges have the same length, the polygon is called equilateral • If all angles have the same measure, the polygon is called equiangular • If the polygon is BOTH equilateral and equiangular, it is called regular • NOTE: Regular is sometimes used to imply only equilateral. In these slides, assume regular means both “equal side length” and “equal angles” Math 110 Math Applications Art, Fall 2018 Classifying Polygons • A polygon is convex if it is NOT possible to draw a line segment that begins and ends within the polygon, but leaves the polygon at some point in between Convex: Not convex: Any line segment we draw will We can find at least one line segment -
New Family of Tilings of Three-Dimensional Euclidean Space by Tetrahedra and Octahedra
New family of tilings of three-dimensional Euclidean space by tetrahedra and octahedra John H. Conwaya, Yang Jiaob, and Salvatore Torquatob,c,1 aDepartment of Mathematics, Princeton University, Princeton, NJ 08544; bPrinceton Institute for the Science and Technology of Materials, Princeton University, Princeton, NJ 08544; and cDepartment of Chemistry, Department of Physics, Princeton Center for Theoretical Science, Program in Computational and Applied Mathematics, Princeton University, Princeton, NJ 08544 Edited* by Ronald L. Graham, University of California, La Jolla, CA, and approved May 17, 2011 (received for review April 7, 2011) It is well known that two regular tetrahedra can be combined with a single regular octahedron to tile (complete fill) three-dimensional Euclidean space R3. This structure was called the “octet truss” by Buckminster Fuller. It was believed that such a tiling, which is the Delaunay tessellation of the face-centered cubic (fcc) lattice, and its closely related stacking variants, are the only tessellations of R3 that involve two different regular polyhedra. Here we identify and analyze a unique family comprised of a noncountably infinite number of periodic tilings of R3 whose smallest repeat tiling unit Fig. 1. The three regular tilings of the plane: (A) A portion of the tiling by triangles with a fundamental cell containing two triangles with two different consists of one regular octahedron and six smaller regular tetrahe- orientations (shown by different shadings). (B) A portion of the tiling by dra. We first derive an extreme member of this unique tiling family squares. (C) A portion of the tiling by hexagons. by showing that the “holes” in the optimal lattice packing of octa- hedra, obtained by Minkowski over a century ago, are congruent regular polygons and the remaining two of which are made of tetrahedra. -
Properties of Convex Pentagonal Tiles for Periodic Tiling
1 Properties of Convex Pentagonal Tiles for Periodic Tiling Teruhisa SUGIMOTO The Interdisciplinary Institute of Science, Technology and Art, Suzukidaini-building 211, 2-5-28 Kitahara, Asaka-shi, Saitama, 351-0036, Japan E-mail address: [email protected] Abstract A convex pentagonal tile is a convex pentagon that admits a monohedral tiling. We show that a convex pentagonal tile that admits a periodic tiling has a property in which the sum of three internal angles of the pentagon is equal to 360◦. Keywords: convex pentagon, tile, periodic tiling, monohedral tiling 1 Introduction A tiling or tessellation of the plane is a collection of sets that are called tiles, which covers a plane without gaps and overlaps, except for the boundaries of the tiles. If all the tiles in a tiling are of the same size and shape, then the tiling is monohedral. Then, a polygon that admits a monohedral tiling is called a prototile of monohedral tiling, or simply, a polygonal tile. A tiling by convex polygons is edge-to-edge if any two convex polygons in a tiling are either disjoint or share one vertex or an entire edge in common [4,5,14,16{20]. A tiling of the plane is periodic if the tiling can be translated onto itself in two nonparallel directions [4,5,19]. In the classification problem of convex polygonal tiles, only the pentagonal case is open. At present, fifteen families of convex pentagonal tiles, each of them referred to as a \Type" (i.e., Type 1, Type 2, etc. up to Type 15), are known (see Figure 1) but it is not known whether this list is complete1 [2{14,17,20,22,23]. -
Tiling with Penalties and Isoperimetry with Density
Rose-Hulman Undergraduate Mathematics Journal Volume 13 Issue 1 Article 6 Tiling with Penalties and Isoperimetry with Density Yifei Li Berea College, [email protected] Michael Mara Williams College, [email protected] Isamar Rosa Plata University of Puerto Rico, [email protected] Elena Wikner Williams College, [email protected] Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj Recommended Citation Li, Yifei; Mara, Michael; Plata, Isamar Rosa; and Wikner, Elena (2012) "Tiling with Penalties and Isoperimetry with Density," Rose-Hulman Undergraduate Mathematics Journal: Vol. 13 : Iss. 1 , Article 6. Available at: https://scholar.rose-hulman.edu/rhumj/vol13/iss1/6 Rose- Hulman Undergraduate Mathematics Journal Tiling with Penalties and Isoperimetry with Density Yifei Lia Michael Marab Isamar Rosa Platac Elena Wiknerd Volume 13, No. 1, Spring 2012 aDepartment of Mathematics and Computer Science, Berea College, Berea, KY 40404 [email protected] bDepartment of Mathematics and Statistics, Williams College, Williamstown, MA 01267 [email protected] cDepartment of Mathematical Sciences, University of Puerto Rico at Sponsored by Mayagez, Mayagez, PR 00680 [email protected] dDepartment of Mathematics and Statistics, Williams College, Rose-Hulman Institute of Technology Williamstown, MA 01267 [email protected] Department of Mathematics Terre Haute, IN 47803 Email: [email protected] http://www.rose-hulman.edu/mathjournal Rose-Hulman Undergraduate Mathematics Journal Volume 13, No. 1, Spring 2012 Tiling with Penalties and Isoperimetry with Density Yifei Li Michael Mara Isamar Rosa Plata Elena Wikner Abstract. We prove optimality of tilings of the flat torus by regular hexagons, squares, and equilateral triangles when minimizing weighted combinations of perime- ter and number of vertices. -
2.1. Bilateral Symmetry
Symmetry through the Eyes of a Chemist Magdolna Hargittai · Istvan´ Hargittai Symmetry through the Eyes of a Chemist Third Edition 123 Magdolna Hargittai Istvan´ Hargittai Budapest University of Technology and Economics P. O. Box 91 H-1521 Budapest Hungary [email protected] [email protected] ISBN: 978-1-4020-5627-7 e-ISBN: 978-1-4020-5628-4 DOI 10.1007/978-1-4020-5628-4 Library of Congress Control Number: 2008926635 c Springer Science+Business Media B.V. 2009 No part of this work may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording or otherwise, without written permission from the Publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Printed on acid-free paper 987654321 springer.com Preface It is gratifying to launch the third edition of our book. Its coming to life testifies about the task it has fulfilled in the service of the commu- nity of chemical research and learning. As we noted in the Prefaces to the first and second editions, our book surveys chemistry from the point of view of symmetry. We present many examples from chem- istry as well as from other fields to emphasize the unifying nature of the symmetry concept. Our aim has been to provide aesthetic plea- sure in addition to learning experience. In our first Preface we paid tribute to two books in particular from which we learned a great deal; they have influenced significantly our approach to the subject matter of our book. -
Collection Volume I
Collection volume I PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Thu, 29 Jul 2010 21:47:23 UTC Contents Articles Abstraction 1 Analogy 6 Bricolage 15 Categorization 19 Computational creativity 21 Data mining 30 Deskilling 41 Digital morphogenesis 42 Heuristic 44 Hidden curriculum 49 Information continuum 53 Knowhow 53 Knowledge representation and reasoning 55 Lateral thinking 60 Linnaean taxonomy 62 List of uniform tilings 67 Machine learning 71 Mathematical morphology 76 Mental model 83 Montessori sensorial materials 88 Packing problem 93 Prior knowledge for pattern recognition 100 Quasi-empirical method 102 Semantic similarity 103 Serendipity 104 Similarity (geometry) 113 Simulacrum 117 Squaring the square 120 Structural information theory 123 Task analysis 126 Techne 128 Tessellation 129 Totem 137 Trial and error 140 Unknown unknown 143 References Article Sources and Contributors 146 Image Sources, Licenses and Contributors 149 Article Licenses License 151 Abstraction 1 Abstraction Abstraction is a conceptual process by which higher, more abstract concepts are derived from the usage and classification of literal, "real," or "concrete" concepts. An "abstraction" (noun) is a concept that acts as super-categorical noun for all subordinate concepts, and connects any related concepts as a group, field, or category. Abstractions may be formed by reducing the information content of a concept or an observable phenomenon, typically to retain only information which is relevant for a particular purpose. For example, abstracting a leather soccer ball to the more general idea of a ball retains only the information on general ball attributes and behavior, eliminating the characteristics of that particular ball.