DOCSLIB.ORG

Tiling a Flat Torus

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Tiling a Flat Torus Tiling a Flat Torus Stephen Hetterich, Corey Manack April 7, 2013 Important: wallpaper spans the entire plane! What is a wallpaper? A wallpaper, A, is a subset of R2; (C), whose translation subgroup LA is a rank 2 discrete subgroup of R2. What is a wallpaper? A wallpaper, A, is a subset of R2; (C), whose translation subgroup LA is a rank 2 discrete subgroup of R2. Important: wallpaper spans the entire plane! Wallpaper: Not a wallpaper: What is a wallpaper? Examples: Not a wallpaper: What is a wallpaper? Examples: Wallpaper: What is a wallpaper? Examples: Wallpaper: Not a wallpaper: Let FA be the set of all isometries of A. FA is called a wallpaper group. LA ⊂ FA Two wallpapers are equivalent if their corresponding wallpaper groups are isomorphic. 17 different wallpaper groups in total. What is a wallpaper? Examples: Now, assume A is a wallpaper. FA is called a wallpaper group. LA ⊂ FA Two wallpapers are equivalent if their corresponding wallpaper groups are isomorphic. 17 different wallpaper groups in total. What is a wallpaper? Examples: Now, assume A is a wallpaper. Let FA be the set of all isometries of A. LA ⊂ FA Two wallpapers are equivalent if their corresponding wallpaper groups are isomorphic. 17 different wallpaper groups in total. What is a wallpaper? Examples: Now, assume A is a wallpaper. Let FA be the set of all isometries of A. FA is called a wallpaper group. 17 different wallpaper groups in total. What is a wallpaper? Examples: Now, assume A is a wallpaper. Let FA be the set of all isometries of A. FA is called a wallpaper group. LA ⊂ FA Two wallpapers are equivalent if their corresponding wallpaper groups are isomorphic. What is a wallpaper? Examples: Now, assume A is a wallpaper. Let FA be the set of all isometries of A. FA is called a wallpaper group. LA ⊂ FA Two wallpapers are equivalent if their corresponding wallpaper groups are isomorphic. 17 different wallpaper groups in total. Wallpaper groups Wallpaper groups Wallpaper groups In other words, L is the set of all integer linear combinations of two linearly independent vectors ~ ~ l1; l2. Given a wallpaper A, LA can be identified with some lattice L (for example, identify a translational ~ ~ symmetry in the direction of l1 with l1 itself). We will use LA and L interchangeably. What is a lattice? A lattice L is a (rank 2) discrete additive subgroup of R2 (or C). Given a wallpaper A, LA can be identified with some lattice L (for example, identify a translational ~ ~ symmetry in the direction of l1 with l1 itself). We will use LA and L interchangeably. What is a lattice? A lattice L is a (rank 2) discrete additive subgroup of R2 (or C). In other words, L is the set of all integer linear combinations of two linearly independent vectors ~ ~ l1; l2. We will use LA and L interchangeably. What is a lattice? A lattice L is a (rank 2) discrete additive subgroup of R2 (or C). In other words, L is the set of all integer linear combinations of two linearly independent vectors ~ ~ l1; l2. Given a wallpaper A, LA can be identified with some lattice L (for example, identify a translational ~ ~ symmetry in the direction of l1 with l1 itself). What is a lattice? A lattice L is a (rank 2) discrete additive subgroup of R2 (or C). In other words, L is the set of all integer linear combinations of two linearly independent vectors ~ ~ l1; l2. Given a wallpaper A, LA can be identified with some lattice L (for example, identify a translational ~ ~ symmetry in the direction of l1 with l1 itself). We will use LA and L interchangeably. Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T Description 1 - The lattice Λ itself. So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. What is a flat torus? Several descriptions of T Description 1 - The lattice Λ itself. So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Description 1 - The lattice Λ itself. So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T Description 1 - The lattice Λ itself. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T Description 1 - The lattice Λ itself. So we can make calculations. Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T Description 1 - The lattice Λ itself. So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) So we can look at pretty pictures. What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T Description 1 - The lattice Λ itself. So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 What is a flat torus? Definition: T = R2=Λ, meaning T is the quotient of R2 by some lattice Λ =< v~1; v~2 >,. Several descriptions of T Description 1 - The lattice Λ itself. So we can make calculations. Description 2 - Schematically: A parallelogram with opposite edges identified (donut shape, cut and laid flat.) Description 3: The fundamental domain F: the convex hull of v~1; v~2; v~1 + v~2 So we can look at pretty pictures. A wallpaper tiles T if translations of F \ A by Λ recover A. (A \ F) + Λ = A Think of Λ as a set of translational symmetries of the plane. BIG Thm. Up to symmetry, A tiles T iff Λ is a rank 2 subgroup of LA. Nutshell. Given a wallpaper A, and a torus T = R2=Λ, we wish to know if the wallpaper “fits nicely” on the surface of the flat torus. (A \ F) + Λ = A Think of Λ as a set of translational symmetries of the plane. BIG Thm. Up to symmetry, A tiles T iff Λ is a rank 2 subgroup of LA. Nutshell. Given a wallpaper A, and a torus T = R2=Λ, we wish to know if the wallpaper “fits nicely” on the surface of the flat torus. A wallpaper tiles T if translations of F \ A by Λ recover A. BIG Thm. Up to symmetry, A tiles T iff Λ is a rank 2 subgroup of LA. Nutshell. Given a wallpaper A, and a torus T = R2=Λ, we wish to know if the wallpaper “fits nicely” on the surface of the flat torus. A wallpaper tiles T if translations of F \ A by Λ recover A. (A \ F) + Λ = A Think of Λ as a set of translational symmetries of the plane. Nutshell. Given a wallpaper A, and a torus T = R2=Λ, we wish to know if the wallpaper “fits nicely” on the surface of the flat torus. A wallpaper tiles T if translations of F \ A by Λ recover A. (A \ F) + Λ = A Think of Λ as a set of translational symmetries of the plane. BIG Thm. Up to symmetry, A tiles T iff Λ is a rank 2 subgroup of LA. Look at p2 vs p6m p2 tiles square T , but p6m does not tile T . Nutshell Look at p2 vs p6m p2 tiles square T , but p6m does not tile T . Nutshell Nutshell Look at p2 vs p6m p2 tiles square T , but p6m does not tile T . Answer: BIG Thm. Whenever Λ ⊂ LA. Counting: Each wallpaper A has a lattice LA =< l1; l2 > The parallelogram P spanned by l1; l2 captures the smallest piece of wallpaper that can be translated (via LA) to cover the entire plane.
Load more

Recommended publications
  • An Introduction to Orbifolds
    An introduction to orbifolds Joan Porti UAB Subdivide and Tile: Triangulating spaces for understanding the world Lorentz Center November 2009 An introduction to orbifolds – p.1/20 Motivation • Γ < Isom(Rn) or Hn discrete and acts properly discontinuously (e.g. a group of symmetries of a tessellation). • If Γ has no fixed points ⇒ Γ\Rn is a manifold. • If Γ has fixed points ⇒ Γ\Rn is an orbifold. An introduction to orbifolds – p.2/20 Motivation • Γ < Isom(Rn) or Hn discrete and acts properly discontinuously (e.g. a group of symmetries of a tessellation). • If Γ has no fixed points ⇒ Γ\Rn is a manifold. • If Γ has fixed points ⇒ Γ\Rn is an orbifold. ··· (there are other notions of orbifold in algebraic geometry, string theory or using grupoids) An introduction to orbifolds – p.2/20 Examples: tessellations of Euclidean plane Γ= h(x, y) → (x + 1, y), (x, y) → (x, y + 1)i =∼ Z2 Γ\R2 =∼ T 2 = S1 × S1 An introduction to orbifolds – p.3/20 Examples: tessellations of Euclidean plane Rotations of angle π around red points (order 2) An introduction to orbifolds – p.3/20 Examples: tessellations of Euclidean plane Rotations of angle π around red points (order 2) 2 2 An introduction to orbifolds – p.3/20 Examples: tessellations of Euclidean plane Rotations of angle π around red points (order 2) 2 2 2 2 2 2 2 2 2 2 2 2 An introduction to orbifolds – p.3/20 Example: tessellations of hyperbolic plane Rotations of angle π, π/2 and π/3 around vertices (order 2, 4, and 6) An introduction to orbifolds – p.4/20 Example: tessellations of hyperbolic plane Rotations of angle π, π/2 and π/3 around vertices (order 2, 4, and 6) 2 4 2 6 An introduction to orbifolds – p.4/20 Definition Informal Definition • An orbifold O is a metrizable topological space equipped with an atlas modelled on Rn/Γ, Γ < O(n) finite, with some compatibility condition.
    [Show full text]
  • Fundamental Principles Governing the Patterning of Polyhedra
    FUNDAMENTAL PRINCIPLES GOVERNING THE PATTERNING OF POLYHEDRA B.G. Thomas and M.A. Hann School of Design, University of Leeds, Leeds LS2 9JT, UK. [email protected] ABSTRACT: This paper is concerned with the regular patterning (or tiling) of the five regular polyhedra (known as the Platonic solids). The symmetries of the seventeen classes of regularly repeating patterns are considered, and those pattern classes that are capable of tiling each solid are identified. Based largely on considering the symmetry characteristics of both the pattern and the solid, a first step is made towards generating a series of rules governing the regular tiling of three-dimensional objects. Key words: symmetry, tilings, polyhedra 1. INTRODUCTION A polyhedron has been defined by Coxeter as “a finite, connected set of plane polygons, such that every side of each polygon belongs also to just one other polygon, with the provision that the polygons surrounding each vertex form a single circuit” (Coxeter, 1948, p.4). The polygons that join to form polyhedra are called faces, 1 these faces meet at edges, and edges come together at vertices. The polyhedron forms a single closed surface, dissecting space into two regions, the interior, which is finite, and the exterior that is infinite (Coxeter, 1948, p.5). The regularity of polyhedra involves regular faces, equally surrounded vertices and equal solid angles (Coxeter, 1948, p.16). Under these conditions, there are nine regular polyhedra, five being the convex Platonic solids and four being the concave Kepler-Poinsot solids. The term regular polyhedron is often used to refer only to the Platonic solids (Cromwell, 1997, p.53).
    [Show full text]
  • Presentations of Groups Acting Discontinuously on Direct Products of Hyperbolic Spaces
    Presentations of Groups Acting Discontinuously on Direct Products of Hyperbolic Spaces∗ E. Jespers A. Kiefer Á. del Río November 6, 2018 Abstract The problem of describing the group of units U(ZG) of the integral group ring ZG of a finite group G has attracted a lot of attention and providing presentations for such groups is a fundamental problem. Within the context of orders, a central problem is to describe a presentation of the unit group of an order O in the simple epimorphic images A of the rational group algebra QG. Making use of the presentation part of Poincaré’s Polyhedron Theorem, Pita, del Río and Ruiz proposed such a method for a large family of finite groups G and consequently Jespers, Pita, del Río, Ruiz and Zalesskii described the structure of U(ZG) for a large family of finite groups G. In order to handle many more groups, one would like to extend Poincaré’s Method to discontinuous subgroups of the group of isometries of a direct product of hyperbolic spaces. If the algebra A has degree 2 then via the Galois embeddings of the centre of the algebra A one considers the group of reduced norm one elements of the order O as such a group and thus one would obtain a solution to the mentioned problem. This would provide presentations of the unit group of orders in the simple components of degree 2 of QG and in particular describe the unit group of ZG for every group G with irreducible character degrees less than or equal to 2.
    [Show full text]
  • Fundamental Domains for Genus-Zero and Genus-One Congruence Subgroups
    LMS J. Comput. Math. 13 (2010) 222{245 C 2010 Author doi:10.1112/S1461157008000041e Fundamental domains for genus-zero and genus-one congruence subgroups C. J. Cummins Abstract In this paper, we compute Ford fundamental domains for all genus-zero and genus-one congruence subgroups. This is a continuation of previous work, which found all such groups, including ones that are not subgroups of PSL(2; Z). To compute these fundamental domains, an algorithm is given that takes the following as its input: a positive square-free integer f, which determines + a maximal discrete subgroup Γ0(f) of SL(2; R); a decision procedure to determine whether a + + given element of Γ0(f) is in a subgroup G; and the index of G in Γ0(f) . The output consists of: a fundamental domain for G, a finite set of bounding isometric circles; the cycles of the vertices of this fundamental domain; and a set of generators of G. The algorithm avoids the use of floating-point approximations. It applies, in principle, to any group commensurable with the modular group. Included as appendices are: MAGMA source code implementing the algorithm; data files, computed in a previous paper, which are used as input to compute the fundamental domains; the data computed by the algorithm for each of the congruence subgroups of genus zero and genus one; and an example, which computes the fundamental domain of a non-congruence subgroup. 1. Introduction The modular group PSL(2; Z) := SL(2; Z)={±12g is a discrete subgroup of PSL(2; R) := SL(2; R)={±12g.
    [Show full text]
  • REPLICATING TESSELLATIONS* ANDREW Vincet Abstract
    SIAM J. DISC. MATH. () 1993 Society for Industrial and Applied Mathematics Vol. 6, No. 3, pp. 501-521, August 1993 014 REPLICATING TESSELLATIONS* ANDREW VINCEt Abstract. A theory of replicating tessellation of R is developed that simultaneously generalizes radix representation of integers and hexagonal addressing in computer science. The tiling aggregates tesselate Eu- clidean space so that the (m + 1)st aggregate is, in turn, tiled by translates of the ruth aggregate, for each m in exactly the same way. This induces a discrete hierarchical addressing systsem on R'. Necessary and sufficient conditions for the existence of replicating tessellations are given, and an efficient algorithm is provided to de- termine whether or not a replicating tessellation is induced. It is shown that the generalized balanced ternary is replicating in all dimensions. Each replicating tessellation yields an associated self-replicating tiling with the following properties: (1) a single tile T tesselates R periodically and (2) there is a linear map A, such that A(T) is tiled by translates of T. The boundary of T is often a fractal curve. Key words, tiling, self-replicating, radix representation AMS(MOS) subject classifications. 52C22, 52C07, 05B45, 11A63 1. Introduction. The standard set notation X + Y {z + y z E X, y E Y} will be used. For a set T c Rn denote by Tx z + T the translate of T to point z. Throughout this paper, A denotes an n-dimensional lattice in l'. A set T tiles a set R by translation by lattice A if R [-JxsA T and the intersection of the interiors of distinct tiles T and Tu is empty.
    [Show full text]
  • Five-Vertex Archimedean Surface Tessellation by Lanthanide-Directed Molecular Self-Assembly
    Five-vertex Archimedean surface tessellation by lanthanide-directed molecular self-assembly David Écijaa,1, José I. Urgela, Anthoula C. Papageorgioua, Sushobhan Joshia, Willi Auwärtera, Ari P. Seitsonenb, Svetlana Klyatskayac, Mario Rubenc,d, Sybille Fischera, Saranyan Vijayaraghavana, Joachim Reicherta, and Johannes V. Bartha,1 aPhysik Department E20, Technische Universität München, D-85478 Garching, Germany; bPhysikalisch-Chemisches Institut, Universität Zürich, CH-8057 Zürich, Switzerland; cInstitute of Nanotechnology, Karlsruhe Institute of Technology, D-76344 Eggenstein-Leopoldshafen, Germany; and dInstitut de Physique et Chimie des Matériaux de Strasbourg (IPCMS), CNRS-Université de Strasbourg, F-67034 Strasbourg, France Edited by Kenneth N. Raymond, University of California, Berkeley, CA, and approved March 8, 2013 (received for review December 28, 2012) The tessellation of the Euclidean plane by regular polygons has by five interfering laser beams, conceived to specifically address been contemplated since ancient times and presents intriguing the surface tiling problem, yielded a distorted, 2D Archimedean- aspects embracing mathematics, art, and crystallography. Sig- like architecture (24). nificant efforts were devoted to engineer specific 2D interfacial In the last decade, the tools of supramolecular chemistry on tessellations at the molecular level, but periodic patterns with surfaces have provided new ways to engineer a diversity of sur- distinct five-vertex motifs remained elusive. Here, we report a face-confined molecular architectures, mainly exploiting molecular direct scanning tunneling microscopy investigation on the cerium- recognition of functional organic species or the metal-directed directed assembly of linear polyphenyl molecular linkers with assembly of molecular linkers (5). Self-assembly protocols have terminal carbonitrile groups on a smooth Ag(111) noble-metal sur- been developed to achieve regular surface tessellations, includ- face.
    [Show full text]
  • Grade 6 Math Circles Tessellations Tiling the Plane
    Faculty of Mathematics Centre for Education in Waterloo, Ontario N2L 3G1 Mathematics and Computing Grade 6 Math Circles October 13/14, 2015 Tessellations Tiling the Plane Do the following activity on a piece of graph paper. Build a pattern that you can repeat all over the page. Your pattern should use one, two, or three different `tiles' but no more than that. It will need to cover the page with no holes or overlapping shapes. Think of this exercises as if you were using tiles to create a pattern for your kitchen counter or a floor. Your pattern does not have to fill the page with straight edges; it can be a pattern with bumpy edges that does not fit the page perfectly. The only rule here is that we have no holes or overlapping between our tiles. Here are two examples, one a square tiling and another that we will call the up-down arrow tiling: Another word for tiling is tessellation. After you have created a tessellation, study it: did you use a weird shape or shapes? Or is your tiling simple and only uses straight lines and 1 polygons? Recall that a polygon is a many sided shape, with each side being a straight line. For example, triangles, trapezoids, and tetragons (quadrilaterals) are all polygons but circles or any shapes with curved sides are not polygons. As polygons grow more sides or become more irregular, you may find it difficult to use them as tiles. When given the previous activity, many will come up with the following tessellations.
    [Show full text]
  • Distortion Elements for Surface Homeomorphisms
    Geometry & Topology 18 (2014) 521–614 msp Distortion elements for surface homeomorphisms EMMANUEL MILITON Let S be a compact orientable surface and f be an element of the group Homeo0.S/ of homeomorphisms of S isotopic to the identity. Denote by fz a lift of f to the universal cover S of S . In this article, the following result is proved: If there exists a z fundamental domain D of the covering S S such that z ! 1 lim dn log.dn/ 0; n n D !C1 n where dn is the diameter of fz .D/, then the homeomorphism f is a distortion element of the group Homeo0.S/. 37C85 1 Introduction r Given a compact manifold M , we denote by Diff0.M / the identity component of the group of C r–diffeomorphisms of M . A way to understand this group is to try to describe its subgroups. In other words, given a group G , does there exist an injective r group morphism from the group G to the group Diff0.M /? In case the answer is positive, one can try to describe the group morphisms from the group G to the group r Diff0.M / (ideally up to conjugacy, but this is often an unattainable goal). The concept of distortion element allows one to obtain rigidity results on group mor- r phisms from G to Diff0.M /. It will provide some very partial answers to these questions. Here is the definition. Remember that a group G is finitely generated if there exists a finite generating set G : any element g in this group is a product of elements 1 2 of G and their inverses, g s s s , where the si are elements of G and the i D 1 2 n are equal to 1 or 1.
    [Show full text]
  • Coxeter Groups As Automorphism Groups of Solid Transitive 3-Simplex Tilings
    Filomat 28:3 (2014), 557–577 Published by Faculty of Sciences and Mathematics, DOI 10.2298/FIL1403557S University of Nis,ˇ Serbia Available at: http://www.pmf.ni.ac.rs/filomat Coxeter Groups as Automorphism Groups of Solid Transitive 3-simplex Tilings Milica Stojanovi´ca aFaculty of Organizational Sciences, Jove Ili´ca154, 11040 Belgrade, Serbia Abstract. In the papers of I.K. Zhuk, then more completely of E. Molnar,´ I. Prok, J. Szirmai all simplicial 3-tilings have been classified, where a symmetry group acts transitively on the simplex tiles. The involved spaces depends on some rotational order parameters. When a vertex of a such simplex lies out of the absolute, e.g. in hyperbolic space H3, then truncation with its polar plane gives a truncated simplex or simply, trunc-simplex. Looking for symmetries of these tilings by simplex or trunc-simplex domains, with their side face pairings, it is possible to find all their group extensions, especially Coxeter’s reflection groups, if they exist. So here, connections between isometry groups and their supergroups is given by expressing the generators and the corresponding parameters. There are investigated simplices in families F3, F4, F6 and appropriate series of trunc-simplices. In all cases the Coxeter groups are the maximal ones. 1. Introduction The isometry groups, acting discontinuously on the hyperbolic 3-space with compact fundamental domain, are called hyperbolic space groups. One possibility to describe them is to look for their fundamental domains. Face pairing identifications of a given polyhedron give us generators and relations for a space group by Poincare´ Theorem [1], [3], [7].
    [Show full text]
  • 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.
    [Show full text]
  • Regular Tilings with Heptagons
    Tilings of the plane Terminology There appears to be some confusion as to the meanings of the terms semi-regular, demi-regular, quasi-regular etc. I shall use the following scheme instead. Monomorphic – consisting of one shape of tile only Bimorphic – consisting of two shapes of tile Trimorphic - consisting of three shapes etc. Regular – consisting of regular polygons only Irregular – containing at least one irregular polygon First order – containing vertices of one type only (ie all verticese are identical) Second order – having two kinds of vertex Third order – having three kinds of vertex etc. Conformal – in which all the vertices coincide with vertices of another polygon Non-conformal – in which vertices of one polygon lie on the edge of anotherRegular Monomorphic Tilings There are three conformal regular monomorphic tilings Square tiling 1S It has 4-fold rotational symmetry, 4 reflection lines and 2 orthogonal translations There are an infinite number of non-conformal variations with lesser symmetry. Triangular tiling 1T It has 6-fold rotational symmetry, 3 reflection lines and 3 translations. Again, there are an infinite number of non-conformal variations with lesser symmetry Hexagonal tiling 1H It has both 6-fold and 3-fold rotational symmetry Regular Bimorphic Tilings Squares and triangles As far as I know there are only two first order regular bimorphic tilings containing squares and triangles This is a first order regular tiling. Each vertex of this tiling has the order SSTTT. 1S 2T The order of this tiling is STSTT. 4S 8T There appear to be a large number of regular bimorphic (ST) tilings of higher orders.
    [Show full text]
  • Local Symmetry Preserving Operations on Polyhedra
    Local Symmetry Preserving Operations on Polyhedra Pieter Goetschalckx Submitted to the Faculty of Sciences of Ghent University in fulfilment of the requirements for the degree of Doctor of Science: Mathematics. Supervisors prof. dr. dr. Kris Coolsaet dr. Nico Van Cleemput Chair prof. dr. Marnix Van Daele Examination Board prof. dr. Tomaž Pisanski prof. dr. Jan De Beule prof. dr. Tom De Medts dr. Carol T. Zamfirescu dr. Jan Goedgebeur © 2020 Pieter Goetschalckx Department of Applied Mathematics, Computer Science and Statistics Faculty of Sciences, Ghent University This work is licensed under a “CC BY 4.0” licence. https://creativecommons.org/licenses/by/4.0/deed.en In memory of John Horton Conway (1937–2020) Contents Acknowledgements 9 Dutch summary 13 Summary 17 List of publications 21 1 A brief history of operations on polyhedra 23 1 Platonic, Archimedean and Catalan solids . 23 2 Conway polyhedron notation . 31 3 The Goldberg-Coxeter construction . 32 3.1 Goldberg ....................... 32 3.2 Buckminster Fuller . 37 3.3 Caspar and Klug ................... 40 3.4 Coxeter ........................ 44 4 Other approaches ....................... 45 References ............................... 46 2 Embedded graphs, tilings and polyhedra 49 1 Combinatorial graphs .................... 49 2 Embedded graphs ....................... 51 3 Symmetry and isomorphisms . 55 4 Tilings .............................. 57 5 Polyhedra ............................ 59 6 Chamber systems ....................... 60 7 Connectivity .......................... 62 References
    [Show full text]