DOCSLIB.ORG

Degree-Regular Triangulations on Surfaces

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Degree-Regular Triangulations on Surfaces DEGREE-REGULAR TRIANGULATIONS OF SURFACES BASUDEB DATTA AND SUBHOJOY GUPTA Abstract. A degree-regular triangulation is one in which each vertex has iden- tical degree. Our main result is that any such triangulation of a (possibly non- compact) surface S is geometric, that is, it is combinatorially equivalent to a geodesic triangulation with respect to a constant curvature metric on S, and we list the possibilities. A key ingredient of the proof is to show that any two d-regular triangulations of the plane for d > 6 are combinatorially equivalent. The proof of this uniqueness result, which is of independent interest, is based on an inductive argument involving some combinatorial topology. 1. Introduction A triangulation of a surface S is an embedded graph whose complementary regions are faces bordered by exactly three edges (see x2 for a more precise definition). Such a triangulation is d-regular if the valency of each vertex is exactly d, and geometric if the triangulation are geodesic segments with respect to a Riemannian metric of constant curvature on S, such that each face is an equilateral triangle. Moreover, two triangulations G1 and G2 of X are combinatorially equivalent if there is a homeomorphism h : X ! X that induces a graph isomorphism from G1 to G2. The existence of such degree-regular geometric triangulations on the simply- connected model spaces (S2; R2 and H2) is well-known. Indeed, a d-regular geomet- ric triangulation of the hyperbolic plane H2 is generated by the Schwarz triangle group ∆(3; d) of reflections across the three sides of a hyperbolic triangle (see x3.2 for a discussion). In this note we prove: Theorem 1.1. Any d-regular triangulation of a surfaceS is combinatorially equiv- alent to a geometric triangulation, and one of the following three possibilities hold: • d < 6, S ∼= S2 and the triangulation corresponds to the boundary of the ∼ 2 tetrahedron, octahedron or icosahedron, or S = RP and the triangulation is a two-fold quotient of the boundary of the icosahedron, • d = 6, the universal cover S~ = E2 and the lift of the triangulation is the standard hexagonal triangulation, • d > 6, S~ = E2 and the lift of the triangulation is the geodesic triangulation generated by the Schwarzian triangle group ∆(3; d). 1 2 BASUDEB DATTA AND SUBHOJOY GUPTA In the case when S is compact, this was proved in [EEK82]; indeed, our work also gives a new proof of their result. A key ingredient in our proof of Theorem 1.1 is the following uniqueness result for triangulations of the plane: Theorem 1.2. For each integer d > 6, any two d-regular triangulations of R2 are combinatorially equivalent. In previous work [DU05] (see also [DM17]), it was shown that the above result is true for d = 6 as well; in this case the triangulation is combinatorially equivalent to the familiar hexagonal triangulation of the Euclidean plane E2. This paper develops a different technique that works for the case of a degree- regular triangulation of the hyperbolic plane H2, where the number of vertices in a compact subcomplex grows exponentially with the radius (see Lemma 4.5). Our proof involves an inductive procedure to construct an exhaustion of the plane by compact triangulated regions; we start with the link of a single vertex, and at each step, add all the links of the boundary vertices. A crucial part of the argument is to ensure that at each step, the region we obtain is a triangulated disk that is determined uniquely by the preceding step; this needs a topological argument involving the Euler characteristic. A uniqueness result akin to Theorem 1.2 is the uniqueness of Archimedean tilings, which was recently proved in [DM] and forms the inspiration for the present work. Note that a tiling (or map) of a surface is a more general notion when the embed- ded graph has complementary faces that are (topological) polygons. The type of a vertex in a tiling is the cyclic collection of integers that determines the number of sides of each polygon surrounding it. If all the vertices in a tiling are of same type then the tiling is called a semi-equivelar map or a uniform tiling. An Archimedean tiling of the plane R2 is a semi-equivelar map of R2 by regular Euclidean polygons; it is a classical fact that there are exactly 11 such tilings of R2 (see also [GS77]). The techniques of this paper can be extended to show the uniqueness of equivelar maps, which are uniform tilings where each vertex is of type [pq], that is, each tile is a p-gon and there are exactly q such polygons around each vertex. This would imply that any equivelar map of a surface is geometric. Once again, this was shown by [EEK82], but only in the case when S is compact. However the following question is, to the best of our knowledge, still open: Question 1.3. Are any two uniform tilings of R2 with the same vertex type com- binatorially equivalent? We hope to address this in a subsequent article. DEGREE-REGULAR TRIANGULATIONS OF SURFACES 3 2. Preliminaries We begin by setting up some definitions and notation that we shall use throughout the paper. A standard reference for basic terminology on graphs is [BM08]. For a graph G, V (G) and E(G) will denote its vertex-set and edge-set respectively, Definition 2.1 (Triangulation). A triangulation of a surface S is an embedded graph G such that • all complementary regions (faces) are (topological) triangles, • each edge in E(G) belongs to (the closure of) exactly two triangles, • each vertex in V (G) belongs to at least 3 triangles, arranged in a cyclic order around it. Further, for v 2 V (G), dG(v) denotes the degree of v in G. A triangulation is d-regular for d ≥ 3 if moreover, each vertex has valency (degree) d. A path with edges u1u2; : : : ; un−1un is denoted by u1-u2- ··· -un. For n ≥ 3, an n-cycle with edges u1u2; : : : ; un−1un; unu1 is denoted by u1-u2- ··· -un-u1 and also by Cn(u1; u2; : : : ; un). If G is a graph and u is a vertex not in G then the join u ∗ G is the simplicial complex whose vertex set is V (G) t fug, edge-set is E(G) t fuv : v 2 V (G)g and the set of 2-simplices is fuvw : vw 2 E(G)g. By a triangulated surface, we mean a simplicial complex whose underlying topo- logical space is a surface (possibly with boundary), such that its 1-skeleton is a triangulation as defined above. Since a closed surface can not be a proper subset of a surface, it follows that a closed triangulated surface can't be a proper sub- complex of a triangulated surface. We identify a triangulated surface by the set of 2-simplices in the complex. If u is a vertex in a 2-dimensional simplicial complex X then the link of u in X, denoted by lkX (u) (or simply lk(u)), is the largest subgraph G of X such that u 62 G and u ∗ G ⊆ X. The subcomplex u ∗ lkX (u) is called the star of u in X and is denoted by stX (u) or simply by st(u). Clearly, the star of a vertex in a triangulated surface is a triangulated 2-disc. A 2-dimensional simplicial complex is a triangulated surface if and only if the links of vertices in X are paths and cycles. Moreover, for a triangulated surface X, lkX (u) is a path if and only if u is a boundary vertex of X. If not mentioned otherwise, by a triangulated surface we mean a triangulated surface without boundary. 4 BASUDEB DATTA AND SUBHOJOY GUPTA 3. Geometric triangulations of surfaces In this section we discuss constructions of d-regular triangulated surfaces where the triangulations are geometric. 3.1. Case of degree d < 6. The following result lists all possibilities of a d- regular triangulated surface when the degree d < 6. Lemma 3.1. Let X be a triangulated surface without boundary. (i) If X is 3-regular, then X is the boundary of a tetrahedron. (ii) If X is 4-regular, then X is the boundary of an octahedron. 2 (iii) If X is 5-regular, then X is either the boundary of an icosahedron, or RP6 (the minimal 6-vertex triangulation of the real projective plane). Remark 3.2. Note that in the following proof of Lemma 3.1 we do not assume that X is finite. 1 0 !a 0 ! %e a ¡SA !! aa A 5 a! % e 4 !a 2 ¡ S aa% 3 e!! ¡ AAS %e %e ¡ AS % e % e ¡ A S 2 % e% e 5 ¡ A S b " A b 0 " ¡ S b " 10 A b " ¡ !a A S b" ¡ ! %e a S 1 0 !! aa A 0 2 5 a!¡ % e 4 !aA 2 S RP6 aa 3 e!! @ S % e %e % @ S % e % e @ S 2 % e% e 5 @ S "b "b " b 0 " b @ S " b " b " b " b @ S " b" b @S " `` `` b " 1 `` `` b@S " `` ` b 0 " ` `` b@S 0 4 " `` `b@S 3 @ I Figure 1 Proof. Part (i). Let a be a vertex whose link is C3(b; c; d). Then c-a-d ⊆ lkX (b). Since, deg(b) = 3, it follows that lkX (b) = C3(c; a; d). Thus, bcd is a simplex and hence the boundary @∆ of the tetrahedron ∆ = abcd is a subcomplex of X. Since, @∆ is a closed triangulated surface, it follows that X = @∆.
Load more

Recommended publications
  • UNIVERSIT´E PARIS 6 PIERRE ET MARIE CURIE Th`Ese De
    UNIVERSITE´ PARIS 6 PIERRE ET MARIE CURIE Th`ese de Doctorat Sp´ecialit´e : Math´ematiques pr´esent´ee par Julien PAUPERT pour obtenir le grade de Docteur de l'Universit´e Paris 6 Configurations de lagrangiens, domaines fondamentaux et sous-groupes discrets de P U(2; 1) Configurations of Lagrangians, fundamental domains and discrete subgroups of P U(2; 1) Soutenue le mardi 29 novembre 2005 devant le jury compos´e de Yves BENOIST (ENS Paris) Elisha FALBEL (Paris 6) Directeur John PARKER (Durham) Fr´ed´eric PAULIN (ENS Paris) Rapporteur Jean-Jacques RISLER (Paris 6) Rapporteur non pr´esent a` la soutenance : William GOLDMAN (Maryland) Remerciements Tout d'abord, merci a` mon directeur de th`ese, Elisha Falbel, pour tout le temps et l'´energie qu'il m'a consacr´es. Merci ensuite a` William Goldman et a` Fr´ed´eric Paulin d'avoir accept´e de rapporter cette th`ese; a` Yves Benoist, John Parker et Jean-Jacques Risler d'avoir bien voulu participer au jury. Merci en particulier a` Fr´ed´eric Paulin et a` John Parker pour les nombreuses corrections et am´eliorations qu'ils ont sugg´er´ees. Pour les nombreuses et enrichissantes conversations math´ematiques durant ces ann´ees de th`ese, je voudrais remercier particuli`erement Martin Deraux et Pierre Will, ainsi que les mem- bres du groupuscule de g´eom´etrie hyperbolique complexe de Chevaleret, Marcos, Masseye et Florent. Merci ´egalement de nouveau a` John Parker et a` Richard Wentworth pour les conversations que nous avons eues et les explications qu'ils m'ont donn´ees lors de leurs visites a` Paris.
    [Show full text]
  • Tsinghua Lectures on Hypergeometric Functions (Unfinished and Comments Are Welcome)
    Tsinghua Lectures on Hypergeometric Functions (Unfinished and comments are welcome) Gert Heckman Radboud University Nijmegen [email protected] December 8, 2015 1 Contents Preface 2 1 Linear differential equations 6 1.1 Thelocalexistenceproblem . 6 1.2 Thefundamentalgroup . 11 1.3 The monodromy representation . 15 1.4 Regular singular points . 17 1.5 ThetheoremofFuchs .. .. .. .. .. .. 23 1.6 TheRiemann–Hilbertproblem . 26 1.7 Exercises ............................. 33 2 The Euler–Gauss hypergeometric function 39 2.1 The hypergeometric function of Euler–Gauss . 39 2.2 The monodromy according to Schwarz–Klein . 43 2.3 The Euler integral revisited . 49 2.4 Exercises ............................. 52 3 The Clausen–Thomae hypergeometric function 55 3.1 The hypergeometric function of Clausen–Thomae . 55 3.2 The monodromy according to Levelt . 62 3.3 The criterion of Beukers–Heckman . 66 3.4 Intermezzo on Coxeter groups . 71 3.5 Lorentzian Hypergeometric Groups . 75 3.6 Prime Number Theorem after Tchebycheff . 87 3.7 Exercises ............................. 93 2 Preface The Euler–Gauss hypergeometric function ∞ α(α + 1) (α + k 1)β(β + 1) (β + k 1) F (α, β, γ; z) = · · · − · · · − zk γ(γ + 1) (γ + k 1)k! Xk=0 · · · − was introduced by Euler in the 18th century, and was well studied in the 19th century among others by Gauss, Riemann, Schwarz and Klein. The numbers α, β, γ are called the parameters, and z is called the variable. On the one hand, for particular values of the parameters this function appears in various problems. For example α (1 z)− = F (α, 1, 1; z) − arcsin z = 2zF (1/2, 1, 3/2; z2 ) π K(z) = F (1/2, 1/2, 1; z2 ) 2 α(α + 1) (α + n) 1 z P (α,β)(z) = · · · F ( n, α + β + n + 1; α + 1 − ) n n! − | 2 with K(z) the Jacobi elliptic integral of the first kind given by 1 dx K(z)= , Z0 (1 x2)(1 z2x2) − − p (α,β) and Pn (z) the Jacobi polynomial of degree n, normalized by α + n P (α,β)(1) = .
    [Show full text]
  • Analytic Vortex Solutions on Compact Hyperbolic Surfaces
    Analytic vortex solutions on compact hyperbolic surfaces Rafael Maldonado∗ and Nicholas S. Mantony Department of Applied Mathematics and Theoretical Physics, Wilberforce Road, Cambridge CB3 0WA, U.K. August 27, 2018 Abstract We construct, for the first time, Abelian-Higgs vortices on certain compact surfaces of constant negative curvature. Such surfaces are represented by a tessellation of the hyperbolic plane by regular polygons. The Higgs field is given implicitly in terms of Schwarz triangle functions and analytic solutions are available for certain highly symmetric configurations. 1 Introduction Consider the Abelian-Higgs field theory on a background surface M with metric ds2 = Ω(x; y)(dx2+dy2). At critical coupling the static energy functional satisfies a Bogomolny bound 2 1 Z B Ω 2 E = + jD Φj2 + 1 − jΦj2 dxdy ≥ πN; (1) 2 2Ω i 2 where the topological invariant N (the `vortex number') is the number of zeros of Φ counted with multiplicity [1]. In the notation of [2] we have taken e2 = τ = 1. Equality in (1) is attained when the fields satisfy the Bogomolny vortex equations, which are obtained by completing the square in (1). In complex coordinates z = x + iy these are 2 Dz¯Φ = 0;B = Ω (1 − jΦj ): (2) This set of equations has smooth vortex solutions. As we explain in section 2, analytical results are most readily obtained when M is hyperbolic, having constant negative cur- vature K = −1, a case which is of interest in its own right due to the relation between arXiv:1502.01990v1 [hep-th] 6 Feb 2015 hyperbolic vortices and SO(3)-invariant instantons, [3].
    [Show full text]
  • Arxiv:1711.01247V1 [Math.CO] 3 Nov 2017 Theorem 1.1
    DEGREE-REGULAR TRIANGULATIONS OF SURFACES BASUDEB DATTA AND SUBHOJOY GUPTA Abstract. A degree-regular triangulation is one in which each vertex has iden- tical degree. Our main result is that any such triangulation of a (possibly non- compact) surface S is geometric, that is, it is combinatorially equivalent to a geodesic triangulation with respect to a constant curvature metric on S, and we list the possibilities. A key ingredient of the proof is to show that any two d-regular triangulations of the plane for d > 6 are combinatorially equivalent. The proof of this uniqueness result, which is of independent interest, is based on an inductive argument involving some combinatorial topology. 1. Introduction A triangulation of a surface S is an embedded graph whose complementary regions are faces bordered by exactly three edges (see x2 for a more precise definition). Such a triangulation is d-regular if the valency of each vertex is exactly d, and geometric if the triangulation are geodesic segments with respect to a Riemannian metric of constant curvature on S, such that each face is an equilateral triangle. Moreover, two triangulations G1 and G2 of S are combinatorially equivalent if there is a homeomorphism h : S ! S that induces a graph isomorphism from G1 to G2. The existence of such degree-regular geometric triangulations on the simply- connected model spaces (S2; R2 and H2) is well-known. Indeed, a d-regular geomet- ric triangulation of the hyperbolic plane H2 is generated by the Schwarz triangle group ∆(3; d) of reflections across the three sides of a hyperbolic triangle (see x3.2 for a discussion).
    [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]
  • Wythoffian Skeletal Polyhedra
    Wythoffian Skeletal Polyhedra by Abigail Williams B.S. in Mathematics, Bates College M.S. in Mathematics, Northeastern 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 Dedication I would like to dedicate this dissertation to my Meme. She has always been my loudest cheerleader and has supported me in all that I have done. Thank you, Meme. ii Abstract of Dissertation Wythoff's construction can be used to generate new polyhedra from the symmetry groups of the regular polyhedra. In this dissertation we examine all polyhedra that can be generated through this construction from the 48 regular polyhedra. We also examine when the construction produces uniform polyhedra and then discuss other methods for finding uniform polyhedra. iii Acknowledgements I would like to start by thanking Professor Schulte for all of the guidance he has provided me over the last few years. He has given me interesting articles to read, provided invaluable commentary on this thesis, had many helpful and insightful discussions with me about my work, and invited me to wonderful conferences. I truly cannot thank him enough for all of his help. I am also very thankful to my committee members for their time and attention. Additionally, I want to thank my family and friends who, for years, have supported me and pretended to care everytime I start talking about math. Finally, I want to thank my husband, Keith.
    [Show full text]
  • Hyperbolization of Euclidean Ornaments
    Hyperbolization of Euclidean Ornaments Martin von Gagern & J¨urgen Richter-Gebert Lehrstuhl f¨ur Geometrie und Visualisierung Zentrum Mathematik, Technische Universit¨at M¨unchen, Germany [email protected], [email protected] Submitted: Oct 30, 2008; Accepted: May 5, 2009; Published: May 22, 2009 Mathematics Subject Classification: Primary 51M09, 52C26; Secondary 51F15, 53A30, 53A35 Abstract In this article we outline a method that automatically transforms an Euclidean ornament into a hyperbolic one. The necessary steps are pattern recognition, sym- metry detection, extraction of a Euclidean fundamental region, conformal deforma- tion to a hyperbolic fundamental region and tessellation of the hyperbolic plane with this patch. Each of these steps has its own mathematical subtleties that are discussed in this article. In particular, it is discussed which hyperbolic symmetry groups are suitable generalizations of Euclidean wallpaper groups. Furthermore it is shown how one can take advantage of methods from discrete differential geometry in order to perform the conformal deformation of the fundamental region. Finally it is demonstrated how a reverse pixel lookup strategy can be used to obtain hyperbolic images with optimal resolution. 1 Introduction Ornaments and regular tiling patterns have a long tradition in human culture. Their ori- gins reach back to ancient cultures like China, Egypt, Greece and the Islam. Each of these cultures has its own specific way to create symmetric decorative patterns. Mathemati- cally the underlying structures are well understood. Taking only the pattern into account (and neglecting possible color symmetries) there are just 24 sporadic groups and 2 infi- nite classes of groups governing the symmetry structure of plane images.
    [Show full text]
  • Definitions Topology/Geometry of Geodesics
    Definitions Topology/Geometry of Geodesics Joseph D. Clinton SNEC-04 Magnus J. Wenninger 28-29 June 2003 Introduction • Definitions • Topology – Goldberg’s polyhedra – Classes of Geodesic polyhedra – Triangular tessellations – Diamond tessellations – Hexagonal tessellations • Geometry – Methods Definitions • Parent Polyhedra Definitions • Planer form of the Parent Polyhedra • Spherical form of the Parent Polyhedra Definitions • Polyhedron Face (F) – Any of the plane or spherical polygons making up the surface of the polyhedron F F Definitions • Principle Triangle (PT) – One of the triangles of the parent polyhedron used in development of the three-way grid of the geodesic form. – It may be planer (PPT) or it PPT may be spherical (PST) PPT PST Definitions • Schwarz Triangle (ST) – “A problem proposed and solved by Schwarz in 1873: to find all spherical triangles which lead, by repeated reflection in their sides, to a set of congruent triangles ST covering the sphere a finite number of times.” – There are only 44 kinds of Schwarz triangles. Definitions • Great Circle Great Circle – Any plane passing through the center of a sphere its intersection with the surface of the sphere is a Great Circle and is the largest circle on the sphere. – All other circles on the surface of the sphere are referred to as Lesser Circles. Circle Center and Sphere Center Definitions cf α Ω • Geodesic Geometrical β Elements – Face angle (α) – Dihedral angle (β) – Central angle (δ) – Axial angle (Ω) – Chord factor (cf) δ Sphere Center (0,0,0) Definitions • Face Angle (Alpha α) – An angle formed by two chords meeting in a common point and lying in a plane that is the face of the α geodesic polyhedron.
    [Show full text]
  • Dictionary of Mathematics
    Dictionary of Mathematics English – Spanish | Spanish – English Diccionario de Matemáticas Inglés – Castellano | Castellano – Inglés Kenneth Allen Hornak Lexicographer © 2008 Editorial Castilla La Vieja Copyright 2012 by Kenneth Allen Hornak Editorial Castilla La Vieja, c/o P.O. Box 1356, Lansdowne, Penna. 19050 United States of America PH: (908) 399-6273 e-mail: [email protected] All dictionaries may be seen at: http://www.EditorialCastilla.com Sello: Fachada de la Universidad de Salamanca (ESPAÑA) ISBN: 978-0-9860058-0-0 All rights reserved. No part of this book may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording or by any informational storage or retrieval system without permission in writing from the author Kenneth Allen Hornak. Reservados todos los derechos. Quedan rigurosamente prohibidos la reproducción de este libro, el tratamiento informático, la transmisión de alguna forma o por cualquier medio, ya sea electrónico, mecánico, por fotocopia, por registro u otros medios, sin el permiso previo y por escrito del autor Kenneth Allen Hornak. ACKNOWLEDGEMENTS Among those who have favoured the author with their selfless assistance throughout the extended period of compilation of this dictionary are Andrew Hornak, Norma Hornak, Edward Hornak, Daniel Pritchard and T.S. Gallione. Without their assistance the completion of this work would have been greatly delayed. AGRADECIMIENTOS Entre los que han favorecido al autor con su desinteresada colaboración a lo largo del dilatado período de acopio del material para el presente diccionario figuran Andrew Hornak, Norma Hornak, Edward Hornak, Daniel Pritchard y T.S. Gallione. Sin su ayuda la terminación de esta obra se hubiera demorado grandemente.
    [Show full text]
  • Symmetrical-Geometry Constructions Defining Helicoidal Biostructures
    Symmetrical-geometry constructions defining helicoidal biostructures. The case of alpha- helix. Mikhail Samoylovicha and Alexander Talisb a Central Scientific Research Institute of Technology "Technomash", Moscow b A.N.Nesmeyanov Institute of Organoelement Compounds of Russian Academy of Sciences, Moscow Correspondence email: [email protected] Abstract The chain of algebraic geometry constructions permits to transfer from the minimal surface with zero instability index, and from the lattice over the ring of cyclotomic integers to the tetra-block helix. The tetra-block is the 7-vertex joining of four tetrahedra sharing common faces; it is considered as a building unit for structures approximated by the chains of regular tetrahedra. The minimality condition of the 7 – vertex tetrablock as a building unit is the consequence of its unique mapping by the Klein’s quartic (which is characterized by the minimal hyperbolic Schwartz triangle) into the minimal finite projective geometry. The topological stability of this helix provided by the pitch to radius ratio H/R of 2π/τ2 (τ is the golden section) and by the local rotation axis order of 40/11 = 40 exp(-H/R). These parameters determine the helix of Сα atoms inside the α – helix with the accuracy of up to 2%. They explain also the bonding relationship i→ i+4 between the i-th amide group and the (i+4)-th carbonil group of the residues in the peptide chain and the observed value of the average segment length of the α-helix which is equal to 11 residues. The tetra-block helix with the N, Сα, С′, О, H atoms in the symmetrically selected positions, determines the structure of the α – helix.
    [Show full text]
  • Uniform Solution for Uniform Polyhedra*
    Uniform Solution for Uniform Polyhedra* Zvi Har'El Department of Mathematics Technion − Israel Institute of Technology Haifa32000, Israel E-Mail: [email protected] ABSTRACT An arbitrary precision solution of uniform polyhedra and their duals is presented. The solution is uniform for all polyhedra givenbytheir kaleidoscopic construction, with no need to ‘examine’ each polyhedron separately. 1. Introduction. Uniform polyhedra, whose faces are regular and vertices equivalent, have been studied since antiq- uity.Best known are the fivePlatonic solids and the 13 Archimedean solids. Wethen have the twoinfinite families of uniform prisms and antiprisms. Allowing for star faces or vertices, we have the four Kepler- Poinsot regular star polyhedra and a rowof53nonconvex uniform polyhedra discovered in the 1880s and the 1930s. The complete set appeared in print for the first time in 1953, in a paper by Coxeter,Longuet- Higgins and Miller ([CLM], see also [S]). Magnus Wenninger’sdelightful book Polyhedron Models [W1], which appeared in 1971 but since has been reprinted manytimes, contains photos and building instructions for cardboard models of these 75 uniform polyhedra. Reading the book, makes the mathematically minded reader wonder: Howare the data for the models obtained? For example, what makes 1. 1600030093 the proper circumradius for a great ret- rosnub icosidodecahedron1 with edge length two? It is easy to check, that these data originate in [CLM, Table 7]. Some of the circumradii are exact, as theyare giveninterms of integers and radicals only,but few, asthe one mentioned above,are givenapprox- imately,toten decimal digits. This may be considered perhaps accurate enough, but if one wants to incor- porate polyhedra in a computer modeling software (cf.
    [Show full text]
  • Fuchsian Triangle Groups and Grothendieck Dessins. Variations on a Theme of Belyi
    Commun. Math. Phys. 163, 605~527 (1994) Communications in Mathematical Physics Springer-Verlag 1994 Fuchsian Triangle Groups and Grothendieck Dessins. Variations on a Theme of Belyi Paula Beazley Cohen 1, Claude Itzykson 2, Jiirgen Wolfart 3 1 URA 747 CNRS, Collbge de Prance, 3 rue d'Ulm, F-75231 Paris Cedex 05, France 2 Service de Physique Th6orique, Centre d'6tudes de Saclay, F-91191 Gif-sur-Yvette Cedex, France 3 Math. Seminar der Univ., Robert-Mayer-Strasse 10, D-60054 Frankfurt a.M., Germany Received: 13 May 1993/in revised form: 22 September 1993 Abstract: According to a theorem of Belyi, a smooth projective algebraic curve is defined over a number field if and only if there exists a non-constant element of its function field ramified only over 0, 1 and ec. The existence of such a Belyi function is equivalent to that of a representation of the curve as a possibly compactified quotient space of the Poincar6 upper half plane by a subgroup of finite index in a Fuchsian triangle group. On the other hand, Fuchsian triangle groups arise in many contexts, such as in the theory of hypergeometric functions and certain triangular billiard problems, which would appear at first sight to have no relation to the Galois problems that motivated the above discovery of Belyi. In this note we review several results related to Belyi's theorem and we develop certain aspects giving examples. For preliminary accounts, see the preprint [Wol], the conference proceedings article [Baultz] and the "Comptes Rendus" note [CoWo2]. 0. Introduction While several years ago the moduli space of compact Riemann surfaces seemed to be as remote a subject of consideration in theoretical physics as possible, it plays nowadays a considerable role from various points of view.
    [Show full text]