THE BORROMEAN RINGS DO NOT EXIST 1. INTRODUCTION The
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Borromean Rings: a Video About the New IMU Logo
The Borromean Rings: A Video about the New IMU Logo Charles Gunn and John M. Sullivan∗ Technische Universitat¨ Berlin Institut fur¨ Mathematik, MA 3–2 Str. des 17. Juni 136 10623 Berlin, Germany Email: {gunn,sullivan}@math.tu-berlin.de Abstract This paper describes our video The Borromean Rings: A new logo for the IMU, which was premiered at the opening ceremony of the last International Congress. The video explains some of the mathematics behind the logo of the In- ternational Mathematical Union, which is based on the tight configuration of the Borromean rings. This configuration has pyritohedral symmetry, so the video includes an exploration of this interesting symmetry group. Figure 1: The IMU logo depicts the tight config- Figure 2: A typical diagram for the Borromean uration of the Borromean rings. Its symmetry is rings uses three round circles, with alternating pyritohedral, as defined in Section 3. crossings. In the upper corners are diagrams for two other three-component Brunnian links. 1 The IMU Logo and the Borromean Rings In 2004, the International Mathematical Union (IMU), which had never had a logo, announced a competition to design one. The winning entry, shown in Figure 1, was designed by one of us (Sullivan) with help from Nancy Wrinkle. It depicts the Borromean rings, not in the usual diagram (Figure 2) but instead in their tight configuration, the shape they have when tied tight in thick rope. This IMU logo was unveiled at the opening ceremony of the International Congress of Mathematicians (ICM 2006) in Madrid. We were invited to produce a short video [10] about some of the mathematics behind the logo; it was shown at the opening and closing ceremonies, and can be viewed at www.isama.org/jms/Videos/imu/. -
Hyperbolic 4-Manifolds and the 24-Cell
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Florence Research Universita` degli Studi di Firenze Dipartimento di Matematica \Ulisse Dini" Dottorato di Ricerca in Matematica Hyperbolic 4-manifolds and the 24-cell Leone Slavich Tutor Coordinatore del Dottorato Prof. Graziano Gentili Prof. Alberto Gandolfi Relatore Prof. Bruno Martelli Ciclo XXVI, Settore Scientifico Disciplinare MAT/03 Contents Index 1 1 Introduction 2 2 Basics of hyperbolic geometry 5 2.1 Hyperbolic manifolds . .7 2.1.1 Horospheres and cusps . .8 2.1.2 Manifolds with boundary . .9 2.2 Link complements and Kirby calculus . 10 2.2.1 Basics of Kirby calculus . 12 3 Hyperbolic 3-manifolds from triangulations 15 3.1 Hyperbolic relative handlebodies . 18 3.2 Presentations as a surgery along partially framed links . 19 4 The ambient 4-manifold 23 4.1 The 24-cell . 23 4.2 Mirroring the 24-cell . 24 4.3 Face pairings of the boundary 3-strata . 26 5 The boundary manifold as link complement 33 6 Simple hyperbolic 4-manifolds 39 6.1 A minimal volume hyperbolic 4-manifold with two cusps . 39 6.1.1 Gluing of the boundary components . 43 6.2 A one-cusped hyperbolic 4-manifold . 45 6.2.1 Glueing of the boundary components . 46 1 Chapter 1 Introduction In the early 1980's, a major breakthrough in the field of low-dimensional topology was William P. Thurston's geometrization theorem for Haken man- ifolds [16] and the subsequent formulation of the geometrization conjecture, proven by Grigori Perelman in 2005. -
Deep Learning the Hyperbolic Volume of a Knot Arxiv:1902.05547V3 [Hep-Th] 16 Sep 2019
Deep Learning the Hyperbolic Volume of a Knot Vishnu Jejjalaa;b , Arjun Karb , Onkar Parrikarb aMandelstam Institute for Theoretical Physics, School of Physics, NITheP, and CoE-MaSS, University of the Witwatersrand, Johannesburg, WITS 2050, South Africa bDavid Rittenhouse Laboratory, University of Pennsylvania, 209 S 33rd Street, Philadelphia, PA 19104, USA E-mail: [email protected], [email protected], [email protected] Abstract: An important conjecture in knot theory relates the large-N, double scaling limit of the colored Jones polynomial JK;N (q) of a knot K to the hyperbolic volume of the knot complement, Vol(K). A less studied question is whether Vol(K) can be recovered directly from the original Jones polynomial (N = 2). In this report we use a deep neural network to approximate Vol(K) from the Jones polynomial. Our network is robust and correctly predicts the volume with 97:6% accuracy when training on 10% of the data. This points to the existence of a more direct connection between the hyperbolic volume and the Jones polynomial. arXiv:1902.05547v3 [hep-th] 16 Sep 2019 Contents 1 Introduction1 2 Setup and Result3 3 Discussion7 A Overview of knot invariants9 B Neural networks 10 B.1 Details of the network 12 C Other experiments 14 1 Introduction Identifying patterns in data enables us to formulate questions that can lead to exact results. Since many of these patterns are subtle, machine learning has emerged as a useful tool in discovering these relationships. In this work, we apply this idea to invariants in knot theory. -
THE JONES SLOPES of a KNOT Contents 1. Introduction 1 1.1. The
THE JONES SLOPES OF A KNOT STAVROS GAROUFALIDIS Abstract. The paper introduces the Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the Jones slopes (a finite set of rational numbers) and the Jones period (a natural number) of a knot in 3-space. We formulate a number of conjectures for these invariants and verify them by explicit computations for the class of alternating knots, the knots with at most 9 crossings, the torus knots and the (−2, 3,n) pretzel knots. Contents 1. Introduction 1 1.1. The degree of the Jones polynomial and incompressible surfaces 1 1.2. The degree of the colored Jones function is a quadratic quasi-polynomial 3 1.3. q-holonomic functions and quadratic quasi-polynomials 3 1.4. The Jones slopes and the Jones period of a knot 4 1.5. The symmetrized Jones slopes and the signature of a knot 5 1.6. Plan of the proof 7 2. Future directions 7 3. The Jones slopes and the Jones period of an alternating knot 8 4. Computing the Jones slopes and the Jones period of a knot 10 4.1. Some lemmas on quasi-polynomials 10 4.2. Computing the colored Jones function of a knot 11 4.3. Guessing the colored Jones function of a knot 11 4.4. A summary of non-alternating knots 12 4.5. The 8-crossing non-alternating knots 13 4.6. -
A Knot-Vice's Guide to Untangling Knot Theory, Undergraduate
A Knot-vice’s Guide to Untangling Knot Theory Rebecca Hardenbrook Department of Mathematics University of Utah Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 1 / 26 What is Not a Knot? Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 2 / 26 What is a Knot? 2 A knot is an embedding of the circle in the Euclidean plane (R ). 3 Also defined as a closed, non-self-intersecting curve in R . 2 Represented by knot projections in R . Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 3 / 26 Why Knots? Late nineteenth century chemists and physicists believed that a substance known as aether existed throughout all of space. Could knots represent the elements? Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 4 / 26 Why Knots? Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 5 / 26 Why Knots? Unfortunately, no. Nevertheless, mathematicians continued to study knots! Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 6 / 26 Current Applications Natural knotting in DNA molecules (1980s). Credit: K. Kimura et al. (1999) Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 7 / 26 Current Applications Chemical synthesis of knotted molecules – Dietrich-Buchecker and Sauvage (1988). Credit: J. Guo et al. (2010) Rebecca Hardenbrook A Knot-vice’s Guide to Untangling Knot Theory 8 / 26 Current Applications Use of lattice models, e.g. the Ising model (1925), and planar projection of knots to find a knot invariant via statistical mechanics. Credit: D. Chicherin, V.P. -
Gauss' Linking Number Revisited
October 18, 2011 9:17 WSPC/S0218-2165 134-JKTR S0218216511009261 Journal of Knot Theory and Its Ramifications Vol. 20, No. 10 (2011) 1325–1343 c World Scientific Publishing Company DOI: 10.1142/S0218216511009261 GAUSS’ LINKING NUMBER REVISITED RENZO L. RICCA∗ Department of Mathematics and Applications, University of Milano-Bicocca, Via Cozzi 53, 20125 Milano, Italy [email protected] BERNARDO NIPOTI Department of Mathematics “F. Casorati”, University of Pavia, Via Ferrata 1, 27100 Pavia, Italy Accepted 6 August 2010 ABSTRACT In this paper we provide a mathematical reconstruction of what might have been Gauss’ own derivation of the linking number of 1833, providing also an alternative, explicit proof of its modern interpretation in terms of degree, signed crossings and inter- section number. The reconstruction presented here is entirely based on an accurate study of Gauss’ own work on terrestrial magnetism. A brief discussion of a possibly indepen- dent derivation made by Maxwell in 1867 completes this reconstruction. Since the linking number interpretations in terms of degree, signed crossings and intersection index play such an important role in modern mathematical physics, we offer a direct proof of their equivalence. Explicit examples of its interpretation in terms of oriented area are also provided. Keywords: Linking number; potential; degree; signed crossings; intersection number; oriented area. Mathematics Subject Classification 2010: 57M25, 57M27, 78A25 1. Introduction The concept of linking number was introduced by Gauss in a brief note on his diary in 1833 (see Sec. 2 below), but no proof was given, neither of its derivation, nor of its topological meaning. Its derivation remained indeed a mystery. -
Knots: a Handout for Mathcircles
Knots: a handout for mathcircles Mladen Bestvina February 2003 1 Knots Informally, a knot is a knotted loop of string. You can create one easily enough in one of the following ways: • Take an extension cord, tie a knot in it, and then plug one end into the other. • Let your cat play with a ball of yarn for a while. Then find the two ends (good luck!) and tie them together. This is usually a very complicated knot. • Draw a diagram such as those pictured below. Such a diagram is a called a knot diagram or a knot projection. Trefoil and the figure 8 knot 1 The above two knots are the world's simplest knots. At the end of the handout you can see many more pictures of knots (from Robert Scharein's web site). The same picture contains many links as well. A link consists of several loops of string. Some links are so famous that they have names. For 2 2 3 example, 21 is the Hopf link, 51 is the Whitehead link, and 62 are the Bor- romean rings. They have the feature that individual strings (or components in mathematical parlance) are untangled (or unknotted) but you can't pull the strings apart without cutting. A bit of terminology: A crossing is a place where the knot crosses itself. The first number in knot's \name" is the number of crossings. Can you figure out the meaning of the other number(s)? 2 Reidemeister moves There are many knot diagrams representing the same knot. For example, both diagrams below represent the unknot. -
Computing the Writhing Number of a Polygonal Knot
Computing the Writhing Number of a Polygonal Knot ¡ ¡£¢ ¡ Pankaj K. Agarwal Herbert Edelsbrunner Yusu Wang Abstract Here the linking number, , is half the signed number of crossings between the two boundary curves of the ribbon, The writhing number measures the global geometry of a and the twisting number, , is half the average signed num- closed space curve or knot. We show that this measure is ber of local crossing between the two curves. The non-local related to the average winding number of its Gauss map. Us- crossings between the two curves correspond to crossings ing this relationship, we give an algorithm for computing the of the ribbon axis, which are counted by the writhing num- ¤ writhing number for a polygonal knot with edges in time ber, . A small subset of the mathematical literature on ¥§¦ ¨ roughly proportional to ¤ . We also implement a different, the subject can be found in [3, 20]. Besides the mathemat- simple algorithm and provide experimental evidence for its ical interest, the White Formula and the writhing number practical efficiency. have received attention both in physics and in biochemistry [17, 23, 26, 30]. For example, they are relevant in under- standing various geometric conformations we find for circu- 1 Introduction lar DNA in solution, as illustrated in Figure 1 taken from [7]. By representing DNA as a ribbon, the writhing number of its The writhing number is an attempt to capture the physical phenomenon that a cord tends to form loops and coils when it is twisted. We model the cord by a knot, which we define to be an oriented closed curve in three-dimensional space. -
Forming the Borromean Rings out of Polygonal Unknots
Forming the Borromean Rings out of polygonal unknots Hugh Howards 1 Introduction The Borromean Rings in Figure 1 appear to be made out of circles, but a result of Freedman and Skora shows that this is an optical illusion (see [F] or [H]). The Borromean Rings are a special type of Brunninan Link: a link of n components is one which is not an unlink, but for which every sublink of n − 1 components is an unlink. There are an infinite number of distinct Brunnian links of n components for n ≥ 3, but the Borromean Rings are the most famous example. This fact that the Borromean Rings cannot be formed from circles often comes as a surprise, but then we come to the contrasting result that although it cannot be built out of circles, the Borromean Rings can be built out of convex curves, for example, one can form it from two circles and an ellipse. Although it is only one out of an infinite number of Brunnian links of three Figure 1: The Borromean Rings. 1 components, it is the only one which can be built out of convex compo- nents [H]. The convexity result is, in fact a bit stronger and shows that no 4 component Brunnian link can be made out of convex components and Davis generalizes this result to 5 components in [D]. While this shows it is in some sense hard to form most Brunnian links out of certain shapes, the Borromean Rings leave some flexibility. This leads to the question of what shapes can be used to form the Borromean Rings and the following surprising conjecture of Matthew Cook at the California Institute of Technology. -
Hyperbolic Structures from Link Diagrams
University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 5-2012 Hyperbolic Structures from Link Diagrams Anastasiia Tsvietkova [email protected] Follow this and additional works at: https://trace.tennessee.edu/utk_graddiss Part of the Geometry and Topology Commons Recommended Citation Tsvietkova, Anastasiia, "Hyperbolic Structures from Link Diagrams. " PhD diss., University of Tennessee, 2012. https://trace.tennessee.edu/utk_graddiss/1361 This Dissertation is brought to you for free and open access by the Graduate School at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. To the Graduate Council: I am submitting herewith a dissertation written by Anastasiia Tsvietkova entitled "Hyperbolic Structures from Link Diagrams." I have examined the final electronic copy of this dissertation for form and content and recommend that it be accepted in partial fulfillment of the equirr ements for the degree of Doctor of Philosophy, with a major in Mathematics. Morwen B. Thistlethwaite, Major Professor We have read this dissertation and recommend its acceptance: Conrad P. Plaut, James Conant, Michael Berry Accepted for the Council: Carolyn R. Hodges Vice Provost and Dean of the Graduate School (Original signatures are on file with official studentecor r ds.) Hyperbolic Structures from Link Diagrams A Dissertation Presented for the Doctor of Philosophy Degree The University of Tennessee, Knoxville Anastasiia Tsvietkova May 2012 Copyright ©2012 by Anastasiia Tsvietkova. All rights reserved. ii Acknowledgements I am deeply thankful to Morwen Thistlethwaite, whose thoughtful guidance and generous advice made this research possible. -
Arxiv:Math/9807161V1
FOUR OBSERVATIONS ON n-TRIVIALITY AND BRUNNIAN LINKS Theodore B. Stanford Mathematics Department United States Naval Academy 572 Holloway Road Annapolis, MD 21402 [email protected] Abstract. Brunnian links have been known for a long time in knot theory, whereas the idea of n-triviality is a recent innovation. We illustrate the relationship between the two concepts with four short theorems. In 1892, Brunn introduced some nontrivial links with the property that deleting any single component produces a trivial link. Such links are now called Brunnian links. (See Rolfsen [7]). Ohyama [5] introduced the idea of a link which can be independantly undone in n different ways. Here “undo” means to change some set of crossings to make the link trivial. “Independant” means that once you change the crossings in any one of the n sets, the link remains trivial no matter what you do to the other n − 1 sets of crossings. Philosophically, the ideas are similar because, after all, once you delete one component of a Brunnian link the result is trivial no matter what you do to the other components. We shall prove four theorems that make the relationship between Brunnian links and n-triviality more precise. We shall show (Theorem 1) that an n-component Brunnian link is (n − 1)-trivial; (Theorem 2) that an n-component Brunnian link with a homotopically trivial component is n-trivial; (Theorem 3) that an (n − k)-component link constructed from an n-component Brunnian link by twisting along k components is (n − 1)-trivial; and (Theorem 4) that a knot is (n − 1)-trivial if and only if it is “locally n-Brunnian equivalent” to the unknot. -
Alexander Polynomial, Finite Type Invariants and Volume of Hyperbolic
ISSN 1472-2739 (on-line) 1472-2747 (printed) 1111 Algebraic & Geometric Topology Volume 4 (2004) 1111–1123 ATG Published: 25 November 2004 Alexander polynomial, finite type invariants and volume of hyperbolic knots Efstratia Kalfagianni Abstract We show that given n > 0, there exists a hyperbolic knot K with trivial Alexander polynomial, trivial finite type invariants of order ≤ n, and such that the volume of the complement of K is larger than n. This contrasts with the known statement that the volume of the comple- ment of a hyperbolic alternating knot is bounded above by a linear function of the coefficients of the Alexander polynomial of the knot. As a corollary to our main result we obtain that, for every m> 0, there exists a sequence of hyperbolic knots with trivial finite type invariants of order ≤ m but ar- bitrarily large volume. We discuss how our results fit within the framework of relations between the finite type invariants and the volume of hyperbolic knots, predicted by Kashaev’s hyperbolic volume conjecture. AMS Classification 57M25; 57M27, 57N16 Keywords Alexander polynomial, finite type invariants, hyperbolic knot, hyperbolic Dehn filling, volume. 1 Introduction k i Let c(K) denote the crossing number and let ∆K(t) := Pi=0 cit denote the Alexander polynomial of a knot K . If K is hyperbolic, let vol(S3 \ K) denote the volume of its complement. The determinant of K is the quantity det(K) := |∆K(−1)|. Thus, in general, we have k det(K) ≤ ||∆K (t)|| := X |ci|. (1) i=0 It is well know that the degree of the Alexander polynomial of an alternating knot equals twice the genus of the knot.