Knots, Tangles and Braid Actions

Total Page:16

File Type:pdf, Size:1020Kb

Knots, Tangles and Braid Actions KNOTS, TANGLES AND BRAID ACTIONS by LIAM THOMAS WATSON B.Sc. The University of British Columbia A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in THE FACULTY OF GRADUATE STUDIES Department of Mathematics We accept this thesis as conforming to the required standard : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : THE UNIVERSITY OF BRITISH COLUMBIA October 2004 c Liam Thomas Watson, 2004 In presenting this thesis in partial fulfillment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for ex- tensive copying of this thesis for scholarly purposes may be granted by the head of my department or by his or her representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission. (Signature) Department of Mathematics The University of British Columbia Vancouver, Canada Date Abstract Recent work of Eliahou, Kauffmann and Thistlethwaite suggests the use of braid actions to alter a link diagram without changing the Jones polynomial. This technique produces non-trivial links (of two or more components) having the same Jones polynomial as the unlink. In this paper, examples of distinct knots that can not be distinguished by the Jones polynomial are constructed by way of braid actions. Moreover, it is shown in general that pairs of knots obtained in this way are not Conway mutants, hence this technique provides new perspective on the Jones polynomial, with a view to an important (and unanswered) question: Does the Jones polynomial detect the unknot? ii Table of Contents Abstract ii Table of Contents iii List of Figures v Acknowledgement vii Chapter 1. Introduction 1 Chapter 2. Knots, Links and Braids 3 2.1 Knots and Links : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.2 Braids : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 Chapter 3. Polynomials 8 3.1 The Jones Polynomial : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 3.2 The Alexander Polynomial : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 3.3 The HOMFLY Polynomial : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 Chapter 4. Tangles and Linear Maps 21 4.1 Conway Tangles : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 21 4.2 Conway Mutation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 25 4.3 The Skein Module : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 27 4.4 Linear Maps : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 31 4.5 Braid Actions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 32 Chapter 5. Kanenobu Knots 37 5.1 Construction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 37 5.2 Basic Examples : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 41 5.3 Main Theorem : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 42 5.4 Examples : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 46 5.5 Generalisation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 50 5.6 More Examples : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 53 5.7 Observations : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 59 iii Table of Contents iv Chapter 6. Thistlethwaite Links 62 6.1 Construction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 62 6.2 Some 2-component examples : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 69 6.3 A 3-component example : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 70 6.4 Closing Remarks : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 71 Bibliography 72 iv List of Figures 2.1 Diagrams of the Trefoil Knot : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.2 The Hopf Link : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 The braid generator σi and its inverse : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 2.4 The link β¯ formed from the closure of β. : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 4.1 Some diagrams of Conway tangles : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 21 4.2 The generator ei : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 30 4.3 The tangle T β : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 33 2 S2 5.1 The Kanenobu knot K(T; U) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 37 5.2 Distinct knots that are not Conway mutants : : : : : : : : : : : : : : : : : : : : : : 43 5.3 Example 1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 47 5.4 Example 2 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 49 5.5 Another diagram of the Kanenobu knot K(T; U) : : : : : : : : : : : : : : : : : : 50 5.6 The link β : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 50 j j 5.7 The closure of a Kanenobu braid : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 51 3 −1 5.8 The braid σ1σ2 σ1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 53 3 −1 −3 −1 5.9 The Kanenobu braid (σ1σ2 σ1)(σ5 σ4σ5 ) : : : : : : : : : : : : : : : : : : : : : : : 53 3 −1 −3 −1 5.10 The knot (σ1σ2 σ1)(σ5 σ4σ5 ) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 54 ? 5.11 The knot K(0; 0) 52 # 52 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 55 −∼1 5.12 The knot K (σ2; σ2 ) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 55 2 −3 5.13 The braid σ1σ2 σ1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 56 2 −3 −2 3 −1 5.14 The Kanenobu braid (σ1σ2 σ1)(σ5 σ4σ5 ) : : : : : : : : : : : : : : : : : : : : : : : 56 2 −3 −2 3 −1 5.15 The knot (σ1σ2 σ1)(σ5 σ4σ5 ) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 57 ? 5.16 The knot K(0; 0) 61 # 61 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 58 −∼1 5.17 The knot K (σ2; σ2 ) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 58 5.18 The 2-bridge link obtained from β B3. : : : : : : : : : : : : : : : : : : : : : : : : : : 59 ? 2 5.19 The square knot 31 # 31 . : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 60 −1 −1 −1 5.20 The knot (σ1σ2 σ1)(σ5 σ4σ5 ) . : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 60 6.1 The Thisleth waite link H(T; U) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 63 6.2 The link H(0; 0) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 63 6.3 The braid ! B3 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 66 2 −1 6.4 The link H(T !; U ! ) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 67 6.5 The result of !2 acting on H(T; U) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 68 6.6 The result of !4 acting on H(T; U) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 68 v List of Figures vi 6.7 A non-trivial, 2-component link : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 69 6.8 A non-trivial, 2-component link : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 70 6.9 A non-trivial, 3-component link : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 71 vi Acknowledgement It's a strange process, writing down the details to something you've been work- ing on for some time. And while it is a particularly solitary experience, the final product is not accomplished on you're own. To this end, there are many people that should be recognised as part of this thesis. First, I would like to thank my supervisor Dale Rolfsen for ongoing patience, guidance and instruction. It has been a privilege and a pleasure to learn from Dale throughout my undergraduate and masters degrees, and I am grateful for his generous support, both intellectual and financial. I have learned so much. Of course, I am indebted to all of my teachers as this work comprises much of what I have learned so far. However, I would like to single out Bill Casselman, as the figures required for this thesis could not have been produced
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/.
    [Show full text]
  • Jones Polynomial for Graphs of Twist Knots
    Available at Applications and Applied http://pvamu.edu/aam Mathematics: Appl. Appl. Math. An International Journal ISSN: 1932-9466 (AAM) Vol. 14, Issue 2 (December 2019), pp. 1269 – 1278 Jones Polynomial for Graphs of Twist Knots 1Abdulgani ¸Sahinand 2Bünyamin ¸Sahin 1Faculty of Science and Letters 2Faculty of Science Department Department of Mathematics of Mathematics Agrı˘ Ibrahim˙ Çeçen University Selçuk University Postcode 04100 Postcode 42130 Agrı,˘ Turkey Konya, Turkey [email protected] [email protected] Received: January 1, 2019; Accepted: March 16, 2019 Abstract We frequently encounter knots in the flow of our daily life. Either we knot a tie or we tie a knot on our shoes. We can even see a fisherman knotting the rope of his boat. Of course, the knot as a mathematical model is not that simple. These are the reflections of knots embedded in three- dimensional space in our daily lives. In fact, the studies on knots are meant to create a complete classification of them. This has been achieved for a large number of knots today. But we cannot say that it has been terminated yet. There are various effective instruments while carrying out all these studies. One of these effective tools is graphs. Graphs are have made a great contribution to the development of algebraic topology. Along with this support, knot theory has taken an important place in low dimensional manifold topology. In 1984, Jones introduced a new polynomial for knots. The discovery of that polynomial opened a new era in knot theory. In a short time, this polynomial was defined by algebraic arguments and its combinatorial definition was made.
    [Show full text]
  • Mutant Knots and Intersection Graphs 1 Introduction
    Mutant knots and intersection graphs S. V. CHMUTOV S. K. LANDO We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. Conversely, if we have a weight system depending only on the intersection graphs of chord diagrams, then the composition of such a weight system with the Kontsevich invariant determines a knot invariant that does not distinguish mutant knots. Thus, an equivalence between finite order invariants not distinguishing mutants and weight systems depending on intersections graphs only is established. We discuss relationship between our results and certain Lie algebra weight systems. 57M15; 57M25 1 Introduction Below, we use standard notions of the theory of finite order, or Vassiliev, invariants of knots in 3-space; their definitions can be found, for example, in [6] or [14], and we recall them briefly in Section 2. All knots are assumed to be oriented. Two knots are said to be mutant if they differ by a rotation of a tangle with four endpoints about either a vertical axis, or a horizontal axis, or an axis perpendicular to the paper. If necessary, the orientation inside the tangle may be replaced by the opposite one. Here is a famous example of mutant knots, the Conway (11n34) knot C of genus 3, and Kinoshita–Terasaka (11n42) knot KT of genus 2 (see [1]). C = KT = Note that the change of the orientation of a knot can be achieved by a mutation in the complement to a trivial tangle.
    [Show full text]
  • Hyperbolic Structures from Link Diagrams
    Hyperbolic Structures from Link Diagrams Anastasiia Tsvietkova, joint work with Morwen Thistlethwaite Louisiana State University/University of Tennessee Anastasiia Tsvietkova, joint work with MorwenHyperbolic Thistlethwaite Structures (UTK) from Link Diagrams 1/23 Every knot can be uniquely decomposed as a knot sum of prime knots (H. Schubert). It also true for non-split links (i.e. if there is no a 2–sphere in the complement separating the link). Of the 14 prime knots up to 7 crossings, 3 are non-hyperbolic. Of the 1,701,935 prime knots up to 16 crossings, 32 are non-hyperbolic. Of the 8,053,378 prime knots with 17 crossings, 30 are non-hyperbolic. Motivation: knots Anastasiia Tsvietkova, joint work with MorwenHyperbolic Thistlethwaite Structures (UTK) from Link Diagrams 2/23 Of the 14 prime knots up to 7 crossings, 3 are non-hyperbolic. Of the 1,701,935 prime knots up to 16 crossings, 32 are non-hyperbolic. Of the 8,053,378 prime knots with 17 crossings, 30 are non-hyperbolic. Motivation: knots Every knot can be uniquely decomposed as a knot sum of prime knots (H. Schubert). It also true for non-split links (i.e. if there is no a 2–sphere in the complement separating the link). Anastasiia Tsvietkova, joint work with MorwenHyperbolic Thistlethwaite Structures (UTK) from Link Diagrams 2/23 Of the 1,701,935 prime knots up to 16 crossings, 32 are non-hyperbolic. Of the 8,053,378 prime knots with 17 crossings, 30 are non-hyperbolic. Motivation: knots Every knot can be uniquely decomposed as a knot sum of prime knots (H.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • A Remarkable 20-Crossing Tangle Shalom Eliahou, Jean Fromentin
    A remarkable 20-crossing tangle Shalom Eliahou, Jean Fromentin To cite this version: Shalom Eliahou, Jean Fromentin. A remarkable 20-crossing tangle. 2016. hal-01382778v2 HAL Id: hal-01382778 https://hal.archives-ouvertes.fr/hal-01382778v2 Preprint submitted on 16 Jan 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A REMARKABLE 20-CROSSING TANGLE SHALOM ELIAHOU AND JEAN FROMENTIN Abstract. For any positive integer r, we exhibit a nontrivial knot Kr with r− r (20·2 1 +1) crossings whose Jones polynomial V (Kr) is equal to 1 modulo 2 . Our construction rests on a certain 20-crossing tangle T20 which is undetectable by the Kauffman bracket polynomial pair mod 2. 1. Introduction In [6], M. B. Thistlethwaite gave two 2–component links and one 3–component link which are nontrivial and yet have the same Jones polynomial as the corre- sponding unlink U 2 and U 3, respectively. These were the first known examples of nontrivial links undetectable by the Jones polynomial. Shortly thereafter, it was shown in [2] that, for any integer k ≥ 2, there exist infinitely many nontrivial k–component links whose Jones polynomial is equal to that of the k–component unlink U k.
    [Show full text]
  • 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.
    [Show full text]
  • Splitting Numbers of Links
    Splitting numbers of links Jae Choon Cha, Stefan Friedl, and Mark Powell Department of Mathematics, POSTECH, Pohang 790{784, Republic of Korea, and School of Mathematics, Korea Institute for Advanced Study, Seoul 130{722, Republic of Korea E-mail address: [email protected] Mathematisches Institut, Universit¨atzu K¨oln,50931 K¨oln,Germany E-mail address: [email protected] D´epartement de Math´ematiques,Universit´edu Qu´ebec `aMontr´eal,Montr´eal,QC, Canada E-mail address: [email protected] Abstract. The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering links and Alexander invariants. As an application, we completely determine the splitting numbers of links with 9 or fewer crossings. Also, with these techniques, we either reprove or improve upon the lower bounds for splitting numbers of links computed by J. Batson and C. Seed using Khovanov homology. 1. Introduction Any link in S3 can be converted to the split union of its component knots by a sequence of crossing changes between different components. Following J. Batson and C. Seed [BS13], we define the splitting number of a link L, denoted by sp(L), as the minimal number of crossing changes in such a sequence. We present two new techniques for obtaining lower bounds for the splitting number. The first approach uses covering links, and the second method arises from the multivariable Alexander polynomial of a link. Our general covering link theorem is stated as Theorem 3.2.
    [Show full text]
  • ON TANGLES and MATROIDS 1. Introduction Two Binary Operations on Matroids, the Two-Sum and the Tensor Product, Were Introduced I
    ON TANGLES AND MATROIDS STEPHEN HUGGETT School of Mathematics and Statistics University of Plymouth, Plymouth PL4 8AA, Devon ABSTRACT Given matroids M and N there are two operations M ⊕2 N and M ⊗ N. When M and N are the cycle matroids of planar graphs these operations have interesting interpretations on the corresponding link diagrams. In fact, given a planar graph there are two well-established methods of generating an alternating link diagram, and in each case the Tutte polynomial of the graph is related to polynomial invariant (Jones or homfly) of the link. Switching from one of these methods to the other corresponds in knot theory to tangle insertion in the link diagrams, and in combinatorics to the tensor product of the cycle matroids of the graphs. Keywords: tangles, knots, Jones polynomials, Tutte polynomials, matroids 1. Introduction Two binary operations on matroids, the two-sum and the tensor product, were introduced in [13] and [4]. In the case when the matroids are the cycle matroids of graphs these give rise to corresponding operations on graphs. Strictly speaking, however, these operations on graphs are not in general well defined, being sensitive to the Whitney twist. Consider the two-sum for a moment: when it is well defined it can be seen simply in terms of the replacement of an edge by a new subgraph: a special case of this is the operation leading to the homeomorphic graphs studied in [11]. Planar graphs define alternating link diagrams, and so the two-sum and tensor product operations are defined on these too: they correspond to insertions of tangles.
    [Show full text]
  • TANGLES for KNOTS and LINKS 1. Introduction It Is
    TANGLES FOR KNOTS AND LINKS ZACHARY ABEL 1. Introduction It is often useful to discuss only small \pieces" of a link or a link diagram while disregarding everything else. For example, the Reidemeister moves describe manipulations surrounding at most 3 crossings, and the skein relations for the Jones and Conway polynomials discuss modifications on one crossing at a time. Tangles may be thought of as small pieces or a local pictures of knots or links, and they provide a useful language to describe the above manipulations. But the power of tangles in knot and link theory extends far beyond simple diagrammatic convenience, and this article provides a short survey of some of these applications. 2. Tangles As Used in Knot Theory Formally, we define a tangle as follows (in this article, everything is in the PL category): Definition 1. A tangle is a pair (A; t) where A =∼ B3 is a closed 3-ball and t is a proper 1-submanifold with @t 6= ;. Note that t may be disconnected and may contain closed loops in the interior of A. We consider two tangles (A; t) and (B; u) equivalent if they are isotopic as pairs of embedded manifolds. An n-string tangle consists of exactly n arcs and 2n boundary points (and no closed loops), and the trivial n-string 2 tangle is the tangle (B ; fp1; : : : ; png) × [0; 1] consisting of n parallel, unintertwined segments. See Figure 1 for examples of tangles. Note that with an appropriate isotopy any tangle (A; t) may be transformed into an equivalent tangle so that A is the unit ball in R3, @t = A \ t lies on the great circle in the xy-plane, and the projection (x; y; z) 7! (x; y) is a regular projection for t; thus, tangle diagrams as shown in Figure 1 are justified for all tangles.
    [Show full text]
  • UW Math Circle May 26Th, 2016
    UW Math Circle May 26th, 2016 We think of a knot (or link) as a piece of string (or multiple pieces of string) that we can stretch and move around in space{ we just aren't allowed to cut the string. We draw a knot on piece of paper by arranging it so that there are two strands at every crossing and by indicating which strand is above the other. We say two knots are equivalent if we can arrange them so that they are the same. 1. Which of these knots do you think are equivalent? Some of these have names: the first is the unkot, the next is the trefoil, and the third is the figure eight knot. 2. Find a way to determine all the knots that have just one crossing when you draw them in the plane. Show that all of them are equivalent to an unknotted circle. The Reidemeister moves are operations we can do on a diagram of a knot to get a diagram of an equivalent knot. In fact, you can get every equivalent digram by doing Reidemeister moves, and by moving the strands around without changing the crossings. Here are the Reidemeister moves (we also include the mirror images of these moves). We want to have a way to distinguish knots and links from one another, so we want to extract some information from a digram that doesn't change when we do Reidemeister moves. Say that a crossing is postively oriented if it you can rotate it so it looks like the left hand picture, and negatively oriented if you can rotate it so it looks like the right hand picture (this depends on the orientation you give the knot/link!) For a link with two components, define the linking number to be the absolute value of the number of positively oriented crossings between the two different components of the link minus the number of negatively oriented crossings between the two different components, #positive crossings − #negative crossings divided by two.
    [Show full text]