BEP Anne Nijsten

Total Page:16

File Type:pdf, Size:1020Kb

BEP Anne Nijsten Eindhoven University of Technology BACHELOR Knots and codes Nijsten, Anne I.O. Award date: 2019 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology. Student theses are made available in the TU/e repository upon obtaining the required degree. The grade received is not published on the document as presented in the repository. The required complexity or quality of research of student theses may vary by program, and the required minimum study period may vary in duration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain Knots and codes Anne Nijsten Supervisor: dr. G.R. Pellikaan Eindhoven University of Technology Department of Mathematics and Computer Science July 19, 2019 Abstract Since the 1860s, interest in mathematical knot theory has been risen, partly due to its applications in other disciplines, like molecular biology and quantum physics. The central problem in this field is determining whether two knots are equivalent. This report gives an overview of knot theory and some of its applications. Further, after introducing some concepts of coding theory, it presents the idea of regarding knots as codes and using properties of codes to discover more about knots. 2 Contents 1 Introduction 4 2 Knot theory 4 2.1 Applications . .5 2.2 Knots . .6 2.3 Braids . .9 2.4 Colorability . 10 2.5 Number of colorings . 12 2.6 Knot determinant . 14 2.7 Alexander polynomial . 14 3 Coding theory 15 3.1 Applications . 16 4 Colorings and codes 17 4.1 Reidemeister moves . 17 4.2 Kauffman-Harary conjecture . 17 4.3 Coloring of braids . 18 5 Future Research 18 6 Conclusion 19 7 References 20 3 1 Introduction Knots have been around since prehistoric times, and are still part of everyday life in many ways. Practical uses include tied shoelaces and are used by climbers and sailors to fasten objects. The Celts used them in an artistic way as decoration, nowadays children knot friendship bracelets as accessories. Incas used them to store information on trading as so-called quipu, or talking knots. Also in mathematics, knots have been around for about 150 years. Central in mathematical knot theory is classification of knots by determining whether two knots are equivalent. This can be done by using techniques from other fields within mathematics. In this report, the theory of error correcting codes will be used to describe knots. Knowledge about knots can be used in many other fields, like physics, chemistry and molecular biology, as also described later in this report. In section 2 the theory of mathematical knots and braids is introduced. There, the concept of knot equivalence and knot invariants are explained, along with some examples of invariants, like `-colorability, knot determinant and Alexander polynomial. Also, some applications of knot theory are given. Section 3 introduces some terms from coding theory, like codes and their equivalence. The theory of knots and codes will be combined in section 4. There, colorings knots and braids are regarded as codes. The final sections discuss possible continuations for future work and conclude on the work described in this report about the combination of knots and codes. 2 Knot theory In mathematics, a knot is a simple, closed curve in space. That is, a knot is an embedding of a unit circle S1 in three-dimensional Euclidean space R3, given by an injective, continuous function f : S1 ! R3 that yields an homeomorphism between S1 and f(S1) = K. Now S1 and K being homeomorphic means that there exists a continuous function between S1 and K that has a continuous inverse. When a knot is deformed without passing through itself, the resulting knot is equivalent. More 3 3 formally, two knots K1 and K2 are equivalent if there exists an homeomorphism h : R ! R , such that h(K1) = K2. These definitions allow us to distinguish between two types of knots: tame knots an wild knots. A knot is tame if it is equivalent to a polygonal knot, that is, a knot that can be represented by a closed chain of a finite number of connected line segments in R3. A knot that is not tame is called a wild knot. In the following text, a knot is assumed to be a tame knot, unless otherwise stated. Examples of (tame) knots are the unknot, or trivial knot, and the trefoil knot. To visualize and manipulate knots, they can be projected on a plane, resulting in knot diagrams like the ones in figure 1 when pictured. The separate lines in these diagrams are called strands. The areas between strands and outside the diagram are called regions. At points where a projection of a knot on a plane crosses itself, in a knot diagram the overstrand is distinguished from the understrand by drawing a break in the understrand. In a regular projection of a knot onto the plane, no more than two points of the knot project to the same point on the plane, the amount of points where the projected knot crosses itself is finite, and the knot crosses itself only transversally. Lemma 2.1. Let D be a diagram of a knot K with n crossings. Then there are n + 2 regions in the diagram. Proof. Construct a graph from D by representing crossings by vertices, and strands by edges, where overstrands in crossings are represented by two edges. Then we have a planar graph, of which each vertex has degree 4. This graph has as many regions as D has. By the handshaking 1 Pn 1 Pn lemma, the graph has 2 1 d(v) = 2 1 4 = 2n edges. Then, by Euler's formula, the graph has 2n − n + 2 = n + 2 regions. In figure 2, a polygonal knot is depicted, which is equivalent to the trefoil knot in the center of figure 1. A wild knot is depicted on the right in figure 2. There the dots indicate an infinite 4 amount of overhand knots following the 4 already drawn. Note that an overhand knot by itself, which is a trefoil knot of which one of the strands is cut through, is not a mathematical knot. The equivalence of two knots may be hard to determine, e.g. in figure 1 it is not immediately clear that the left and right knot diagrams are equivalent. Determining the equivalence of two knots is the central problem in knot theory. [1] Figure 1: The trivial knot (left), trefoil knot (center) and another projection of the trivial knot Figure 2: A polygonal knot (left) and a wild knot A disjoint union of knots, which may be tangled up or linked together, is called a link. More formally, L is a link if it is homeomorphic with a disjoint union of one or more circles. Similar to knots, links can be pictured by link diagrams. A splittable link is a link that consists of several disjoint knots, which are called components of a link. The three knots in figure 1 together could be regarded as a splittable link with three components, because it consists of several knots that can be separated in the plane. The unlink with n components is the splittable link consisting of n disjoint unknots, and is depicted for n = 2 in figure 3. Examples of nontrivial links are the Hopf link and Borromean rings, which consist of two and three components, all unknots, respectively. In figure 3 their link diagrams are pictured. When links can be transformed into each other by deforming their components without letting them pass through themselves or each other, they are considered equivalent. Figure 3: The trivial link of 2 components (left), Hopf link (center) and Borromean rings 2.1 Applications Knots have had many applications over the years. In everyday use they can, for example, be found in shoelaces, as macram´edecorations, aboard sailing ships or in climbing ropes. Apart from fastening physical objects, they have also been used for record keeping, like in South-American quipu, or \talking knots", a coding system used by the Inca people in Peru [6]. These knots often differ from mathematical knots, as the ends of a cord in which the knot is placed are usually not connected. The interest in studying mathematical knots resulted from the hypothesis of Lord Kelvin that atoms were knotted vortices in ether, presented in 1867 [20]. With the idea that different materials 5 consisted of different knots and links, and that their characteristics could be explained by these compositions, the listing of unique knots was started. Although the theory of vortex atoms had become obsolete around the beginning of the twentieth century, investigation of knots continued. Currently, applications of mathematical knots can for example be found in biology, chemistry and physics. In molecular biology, knot theory can be used to model DNA molecules and to study how these are untangled in an efficient way by enzymes [19]. In chemistry, knots are used to determine chirality of molecules, that is, whether the molecule can be deformed into its mirror image [12]. In physics, braids, which are closely related to knots, are used to form logic gates in the idea of a topological quantum computer, which has a lower error rate than other quantum computers that use trapped quantum particles.
Recommended publications
  • Complete Invariant Graphs of Alternating Knots
    Complete invariant graphs of alternating knots Christian Soulié First submission: April 2004 (revision 1) Abstract : Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph is defined for general purpose and for special application to the knots. I - Introduction : Chord diagrams are enhanced to integrate the state sum of all flype moves and then produce an invariant graph for alternating knots. By adding local writhe attribute to these graphs, chiral types of knots are distinguished. The resulting chord-weighted graph is a complete invariant of alternating knots. Condensed chord diagrams and condensed enlacement graphs are introduced and a new type of graph of general purpose is defined : the neighborhood graph. The enlacement graph is enriched by local writhe and chord orientation. Hence this enhanced graph distinguishes mutant alternating knots. As invariant by flype it is also invariant for all alternating knots. The equivalence class of knots with the same enlacement graph is fully specified and extended mutation with flype of tangles is defined. On this way, two enhanced graphs are proposed as complete invariants of alternating knots. I - Introduction II - Definitions and condensed graphs II-1 Knots II-2 Sign of crossing points II-3 Chord diagrams II-4 Enlacement graphs II-5 Condensed graphs III - Realizability and construction III - 1 Realizability
    [Show full text]
  • On Spectral Sequences from Khovanov Homology 11
    ON SPECTRAL SEQUENCES FROM KHOVANOV HOMOLOGY ANDREW LOBB RAPHAEL ZENTNER Abstract. There are a number of homological knot invariants, each satis- fying an unoriented skein exact sequence, which can be realized as the limit page of a spectral sequence starting at a version of the Khovanov chain com- plex. Compositions of elementary 1-handle movie moves induce a morphism of spectral sequences. These morphisms remain unexploited in the literature, perhaps because there is still an open question concerning the naturality of maps induced by general movies. In this paper we focus on the spectral sequences due to Kronheimer-Mrowka from Khovanov homology to instanton knot Floer homology, and on that due to Ozsv´ath-Szab´oto the Heegaard-Floer homology of the branched double cover. For example, we use the 1-handle morphisms to give new information about the filtrations on the instanton knot Floer homology of the (4; 5)-torus knot, determining these up to an ambiguity in a pair of degrees; to deter- mine the Ozsv´ath-Szab´ospectral sequence for an infinite class of prime knots; and to show that higher differentials of both the Kronheimer-Mrowka and the Ozsv´ath-Szab´ospectral sequences necessarily lower the delta grading for all pretzel knots. 1. Introduction Recent work in the area of the 3-manifold invariants called knot homologies has il- luminated the relationship between Floer-theoretic knot homologies and `quantum' knot homologies. The relationships observed take the form of spectral sequences starting with a quantum invariant and abutting to a Floer invariant. A primary ex- ample is due to Ozsv´athand Szab´o[15] in which a spectral sequence is constructed from Khovanov homology of a knot (with Z=2 coefficients) to the Heegaard-Floer homology of the 3-manifold obtained as double branched cover over the knot.
    [Show full text]
  • 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.
    [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]
  • A Symmetry Motivated Link Table
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 15 August 2018 doi:10.20944/preprints201808.0265.v1 Peer-reviewed version available at Symmetry 2018, 10, 604; doi:10.3390/sym10110604 Article A Symmetry Motivated Link Table Shawn Witte1, Michelle Flanner2 and Mariel Vazquez1,2 1 UC Davis Mathematics 2 UC Davis Microbiology and Molecular Genetics * Correspondence: [email protected] Abstract: Proper identification of oriented knots and 2-component links requires a precise link 1 nomenclature. Motivated by questions arising in DNA topology, this study aims to produce a 2 nomenclature unambiguous with respect to link symmetries. For knots, this involves distinguishing 3 a knot type from its mirror image. In the case of 2-component links, there are up to sixteen possible 4 symmetry types for each topology. The study revisits the methods previously used to disambiguate 5 chiral knots and extends them to oriented 2-component links with up to nine crossings. Monte Carlo 6 simulations are used to report on writhe, a geometric indicator of chirality. There are ninety-two 7 prime 2-component links with up to nine crossings. Guided by geometrical data, linking number and 8 the symmetry groups of 2-component links, a canonical link diagram for each link type is proposed. 9 2 2 2 2 2 2 All diagrams but six were unambiguously chosen (815, 95, 934, 935, 939, and 941). We include complete 10 tables for prime knots with up to ten crossings and prime links with up to nine crossings. We also 11 prove a result on the behavior of the writhe under local lattice moves.
    [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]
  • The Multivariable Alexander Polynomial on Tangles by Jana
    The Multivariable Alexander Polynomial on Tangles by Jana Archibald A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Mathematics University of Toronto Copyright c 2010 by Jana Archibald Abstract The Multivariable Alexander Polynomial on Tangles Jana Archibald Doctor of Philosophy Graduate Department of Mathematics University of Toronto 2010 The multivariable Alexander polynomial (MVA) is a classical invariant of knots and links. We give an extension to regular virtual knots which has simple versions of many of the relations known to hold for the classical invariant. By following the previous proofs that the MVA is of finite type we give a new definition for its weight system which can be computed as the determinant of a matrix created from local information. This is an improvement on previous definitions as it is directly computable (not defined recursively) and is computable in polynomial time. We also show that our extension to virtual knots is a finite type invariant of virtual knots. We further explore how the multivariable Alexander polynomial takes local infor- mation and packages it together to form a global knot invariant, which leads us to an extension to tangles. To define this invariant we use so-called circuit algebras, an exten- sion of planar algebras which are the ‘right’ setting to discuss virtual knots. Our tangle invariant is a circuit algebra morphism, and so behaves well under tangle operations and gives yet another definition for the Alexander polynomial. The MVA and the single variable Alexander polynomial are known to satisfy a number of relations, each of which has a proof relying on different approaches and techniques.
    [Show full text]
  • Advances in Carpet Manufacture
    SOFTbank E-Book Center Tehran, Phone: 66403879,66493070 For Educational Use. www.ebookcenter.ir Woodhead Publishing in Textiles: Number 87 Advances in carpet manufacture Edited by K. K. Goswami © SOFTbank2009 Woodhead E-Book Publishing Center Limited Tehran, Phone: 66403879,66493070 For Educational Use. www.ebookcenter.ir Published by Woodhead Publishing Limited in association with The Textile Institute Woodhead Publishing Limited, Abington Hall, Granta Park, Geat Abington Cambridge CB21 6AH, UK www.woodheadpublishing.com Woodhead Publishing India Private Limited, G-2, Vardaan House, 7/28 Ansari Road, Daryaganj, New Delhi ± 110002, India Published in North America by CRC Press LLC, 6000 Broken Sound Parkway, NW, Suite 300, Boca Raton, FL 33487, USA First published 2009, Woodhead Publishing Limited and CRC Press LLC ß Woodhead Publishing Limited, 2009 The authors have asserted their moral rights. This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with permission, and sources are indicated. Reasonable efforts have been made to publish reliable data and information, but the authors and the publishers cannot assume responsibility for the validity of all materials. Neither the authors nor the publishers, nor anyone else associated with this publication, shall be liable for any loss, damage or liability directly or indirectly caused or alleged to be caused by this book. Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, microfilming and recording, or by any information storage or retrieval system, without permission in writing from Woodhead Publishing Limited. The consent of Woodhead Publishing Limited does not extend to copying for general distribution, for promotion, for creating new works, or for resale.
    [Show full text]
  • Oriental Rug Knotting & Construction
    Oriental Rug Knotting & Construction Knotted, Tufted and Flat-Woven Rugs; Knot Types and Density Anatomy of A Hand Knotted Rug A. WARP - The parallel threads running through the entire length of the rug onto which the knots are tied. B. WEFT - The threads running across the width of the rug inserted between all the rows of knots. These threads pass through alternate warp threads. Their job is to secure the knots in parallel lines and to strengthen the fabric. C. KNOT - The term used for a strand of wool yarn which is looped around two adjacent warp threads and then cut to form the pile (surface of carpet). D. OVERCASTING - A simple wrapping of dyed yarn along the entire length of both sides of a handmade rug. E. FRINGE - The visible continuation of the warp threads at both ends of the carpet. F. KILIM - The pileless web of warp and weft between the rug's pile and the knotted fringe. This is also the name for a rug without pile. Types of Oriental Rug Construction Who Uses Which Knot? Line of division (dotted line): distinguishing Turkish Knot (west of line) and Persian Knot areas (east). PERSIAN KNOT WITH ALL OF THE WARP THREADS ON ONE LEVEL TURKISH KNOT WITH ALL OF THE WARP THREADS ON ONE LEVEL PERSIAN KNOT WITH THE WARP THREADS ON TWO DIFFERENT LEVELS OPEN BACK & CLOSED BACK OPEN BACK CLOSED Different methods for finishing the undersides of rugs BACK The FULL LOOP part of the In the CLOSED BACK KNOT is on the UPPER KNOT the FULL LOOP is warp thread on the LOWER warp thread .
    [Show full text]
  • An Introduction to Knot Theory and the Knot Group
    AN INTRODUCTION TO KNOT THEORY AND THE KNOT GROUP LARSEN LINOV Abstract. This paper for the University of Chicago Math REU is an expos- itory introduction to knot theory. In the first section, definitions are given for knots and for fundamental concepts and examples in knot theory, and motivation is given for the second section. The second section applies the fun- damental group from algebraic topology to knots as a means to approach the basic problem of knot theory, and several important examples are given as well as a general method of computation for knot diagrams. This paper assumes knowledge in basic algebraic and general topology as well as group theory. Contents 1. Knots and Links 1 1.1. Examples of Knots 2 1.2. Links 3 1.3. Knot Invariants 4 2. Knot Groups and the Wirtinger Presentation 5 2.1. Preliminary Examples 5 2.2. The Wirtinger Presentation 6 2.3. Knot Groups for Torus Knots 9 Acknowledgements 10 References 10 1. Knots and Links We open with a definition: Definition 1.1. A knot is an embedding of the circle S1 in R3. The intuitive meaning behind a knot can be directly discerned from its name, as can the motivation for the concept. A mathematical knot is just like a knot of string in the real world, except that it has no thickness, is fixed in space, and most importantly forms a closed loop, without any loose ends. For mathematical con- venience, R3 in the definition is often replaced with its one-point compactification S3. Of course, knots in the real world are not fixed in space, and there is no interesting difference between, say, two knots that differ only by a translation.
    [Show full text]
  • Categorified Invariants and the Braid Group
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 143, Number 7, July 2015, Pages 2801–2814 S 0002-9939(2015)12482-3 Article electronically published on February 26, 2015 CATEGORIFIED INVARIANTS AND THE BRAID GROUP JOHN A. BALDWIN AND J. ELISENDA GRIGSBY (Communicated by Daniel Ruberman) Abstract. We investigate two “categorified” braid conjugacy class invariants, one coming from Khovanov homology and the other from Heegaard Floer ho- mology. We prove that each yields a solution to the word problem but not the conjugacy problem in the braid group. In particular, our proof in the Khovanov case is completely combinatorial. 1. Introduction Recall that the n-strand braid group Bn admits the presentation σiσj = σj σi if |i − j|≥2, Bn = σ1,...,σn−1 , σiσj σi = σjσiσj if |i − j| =1 where σi corresponds to a positive half twist between the ith and (i + 1)st strands. Given a word w in the generators σ1,...,σn−1 and their inverses, we will denote by σ(w) the corresponding braid in Bn. Also, we will write σ ∼ σ if σ and σ are conjugate elements of Bn. As with any group described in terms of generators and relations, it is natural to look for combinatorial solutions to the word and conjugacy problems for the braid group: (1) Word problem: Given words w, w as above, is σ(w)=σ(w)? (2) Conjugacy problem: Given words w, w as above, is σ(w) ∼ σ(w)? The fastest known algorithms for solving Problems (1) and (2) exploit the Gar- side structure(s) of the braid group (cf.
    [Show full text]
  • Coefficients of Homfly Polynomial and Kauffman Polynomial Are Not Finite Type Invariants
    COEFFICIENTS OF HOMFLY POLYNOMIAL AND KAUFFMAN POLYNOMIAL ARE NOT FINITE TYPE INVARIANTS GYO TAEK JIN AND JUNG HOON LEE Abstract. We show that the integer-valued knot invariants appearing as the nontrivial coe±cients of the HOMFLY polynomial, the Kau®man polynomial and the Q-polynomial are not of ¯nite type. 1. Introduction A numerical knot invariant V can be extended to have values on singular knots via the recurrence relation V (K£) = V (K+) ¡ V (K¡) where K£, K+ and K¡ are singular knots which are identical outside a small ball in which they di®er as shown in Figure 1. V is said to be of ¯nite type or a ¯nite type invariant if there is an integer m such that V vanishes for all singular knots with more than m singular double points. If m is the smallest such integer, V is said to be an invariant of order m. q - - - ¡@- @- ¡- K£ K+ K¡ Figure 1 As the following proposition states, every nontrivial coe±cient of the Alexander- Conway polynomial is a ¯nite type invariant [1, 6]. Theorem 1 (Bar-Natan). Let K be a knot and let 2 4 2m rK (z) = 1 + a2(K)z + a4(K)z + ¢ ¢ ¢ + a2m(K)z + ¢ ¢ ¢ be the Alexander-Conway polynomial of K. Then a2m is a ¯nite type invariant of order 2m for any positive integer m. The coe±cients of the Taylor expansion of any quantum polynomial invariant of knots after a suitable change of variable are all ¯nite type invariants [2]. For the Jones polynomial we have Date: October 17, 2000 (561).
    [Show full text]