Ftsk-Dependent Xercd-Dif Recombination Unlinks Replication Catenanes in a Stepwise Manner

Total Page:16

File Type:pdf, Size:1020Kb

Ftsk-Dependent Xercd-Dif Recombination Unlinks Replication Catenanes in a Stepwise Manner FtsK-dependent XerCD-dif recombination unlinks replication catenanes in a stepwise manner Koya Shimokawaa, Kai Ishiharab, Ian Graingec, David J. Sherrattd, and Mariel Vazqueze,1 aDepartment of Mathematics, Saitama University, Saitama 380-8570, Japan; bFaculty of Education, Yamaguchi University, Yamaguchi 753-8512, Japan; cSchool of Environmental and Life Sciences, University of Newcastle, Callaghan, NSW 2308, Australia; dDepartment of Biochemistry, University of Oxford, Oxford OX1 3QU, United Kingdom; and eDepartment of Mathematics, San Francisco State University, San Francisco, CA 94132 Edited by De Witt Sumners, Florida State University, Tallahassee, FL, and accepted by the Editorial Board October 17, 2013 (received for review May 10, 2013) In Escherichia coli, complete unlinking of newly replicated sister In E. coli, XerCD-dif recombination plays an essential role in chromosomes is required to ensure their proper segregation at cell chromosome dimer resolution (reviewed in ref. 7). Furthermore, division. Whereas replication links are removed primarily by top- when coupled with FtsK, XerCD recombination at dif sites can oisomerase IV, XerC/XerD-dif site-specific recombination can me- unlink 2m-cats produced in vitro by λ-Integrase (3). These results diate sister chromosome unlinking in Topoisomerase IV-deficient suggested a potential in vivo role for XerCD–FtsK recombination, cells. This reaction is activated at the division septum by the DNA which was then hypothesized to work with TopoIV to unlink translocase FtsK, which coordinates the last stages of chromosome DNA links produced by DNA replication. To test this hypothe- segregation with cell division. It has been proposed that, after being sis, a pair of supercoiled linked plasmids, each with one dif site, activated by FtsK, XerC/XerD-dif recombination removes DNA links was produced in vivo by replication in TopoIV-deficient cells, in a stepwise manner. Here, we provide a mathematically rigorous and these were then incubated in vitro with XerCD–FtsK50C (4). characterization of this topological mechanism of DNA unlinking. The ATP-dependent reaction efficiently produced unlinked cir- We show that stepwise unlinking is the only possible pathway that cles. The ATP dependence of the reaction is likely twofold: firstly strictly reduces the complexity of the substrates at each step. Finally, the DNA translocase activity of FtsK relies upon ATP hydrolysis we propose a topological mechanism for this unlinking reaction. for movement, and in the absence of translocation there is no stimulation of recombination. Secondly, the energy from ATP APPLIED DNA topology | tangle method | Xer recombination | band surgery | hydrolysis is also used to align the two recombining dif sites so MATHEMATICS topology simplification that subsequent recombination produces the observed stepwise reduction in complexity. In addition to right-handed (RH) torus he Escherichia coli chromosome is a 4.6-Mbp circular double- links with parallel sites and with 2–14 crossings, unknotted Tstranded (ds) DNA duplex, in which the two DNA strands dimers and a few dimeric knots were also observed. The exper- are wrapped around each other ∼420,000 times. During repli- imental data suggested a stepwise reaction where crossings are cation, DNA gyrase acts to remove the majority of these strand removed one at a time, iteratively converting links into knots, crossings, but those that remain result in two circular sister into links, until two free circles are obtained (Fig. 1). A control – BIOCHEMISTRY molecules that are nontrivially linked. This creates the topolog- experiment demonstrated that XerCD FtsK50C recombination ical problem of separating the two linked sister chromosomes to could convert knotted dimers (RH torus knots with two directly ensure proper segregation at the time of cell division. Unlinking repeated dif sites) to free circles. Separate experiments showed of replication links in E. coli is largely achieved by Topoisomerase that chromosome unlinking in E. coli can be accomplished in fi IV (TopoIV), a type II topoisomerase (1, 2). However, Ip et al. vivo by multiple rounds of XerCD-dif or Cre-loxP site-speci c demonstrated that XerC/XerD-dif (XerCD-dif) site-specific re- combination, coupled with action of the translocase FtsK, could Significance resolve linked plasmid substrates in vitro and hypothesized that this system could work alongside, yet independently of, TopoIV Newly replicated circular chromosomes are topologically linked. during in vivo unlinking of replicative catenanes in the bacterial XerC/XerD-dif (XerCD-dif)–FtsK recombination acts in the repli- chromosome (3). Grainge et al. then demonstrated that in- cation termination region of the Escherichia coli chromosome to creased site-specific recombination could indeed compensate for remove links introduced during homologous recombination and a loss of TopoIV activity in unlinking chromosomes in vivo (4). replication, whereas Topoisomerase IV removes replication links When the activity of TopoIV is blocked, the result is cell le- only. Based on gel mobility patterns of the products of recombi- thality. We here propose a mathematically rigorous analysis to nation, a stepwise unlinking pathway has been proposed. Here, describe the pathway and mechanisms of unlinking of replication we present a rigorous mathematical validation of this model, a links by XerCD–FtsK. This work places a fundamental biological significant advance over prior biological approaches. We show process within a mathematical context. definitively that there is a unique shortest pathway of unlinking Site-specific recombination is a process of breakage and re- by XerCD-dif–FtsK that strictly reduces the complexity of the union at two specific dsDNA duplexes (the recombination sites). links at every step. We delineate the mechanism of action of When the DNA substrate consists of circular DNA molecules, the enzymes at each step along this pathway and provide a 3D the recombination sites may occur in a single DNA circle or in interpretation of the results. separate circles. Two sites are in direct repeat if they are in the Author contributions: K.S., D.J.S., and M.V. designed research; K.S., K.I., and M.V. per- same orientation on one DNA circle (Fig. 1). The relative ori- formed research; K.S., K.I., I.G., D.J.S., and M.V. contributed new reagents/analytic tools; entation of the sites is harder to characterize when the two sites K.S., K.I., I.G., D.J.S., and M.V. analyzed data; and K.S., I.G., D.J.S., and M.V. wrote the are on separate DNA circles. In the case of simple torus links paper. with 2m crossings (also called 2m-catenanes, or 2m-cats) for an The authors declare no conflict of interest. integer m > 1, the sites are said to be in parallel or antiparallel This article is a PNAS Direct Submission. D.W.S. is a guest editor invited by the Editorial Board. orientation with respect to each other (Fig. 1). Site-specific re- Freely available online through the PNAS open access option. combination occurs in two steps (5, 6): first, the recombination 1To whom correspondence should be addressed. E-mail: [email protected]. sites are brought together (synapsis); second, each site is cleaved This article contains supporting information online at www.pnas.org/lookup/suppl/doi:10. and the DNA ends are exchanged, then rejoined. 1073/pnas.1308450110/-/DCSupplemental. www.pnas.org/cgi/doi/10.1073/pnas.1308450110 PNAS Early Edition | 1of6 Downloaded by guest on September 28, 2021 dimensional topology, one can show that the tangles involved are all rational (14, 15, 21). Therefore, all solutions to the XerCD– psi system of equations can be computed using tangle calculus. There are only three solutions consistent with the experimental data (15). It was further shown that these solutions can be seen as different projections of the same three-dimensional (3D) ob- ject, and a unique topological mechanism for XerCD at psi was Fig. 1. Proposed stepwise unlinking by XerCD-dif–FtsK recombination: Parallel proposed that incorporated all three solutions (15). RH 2m-cats [e.g., T(2,6)p] are converted to RH torus knots [e.g., T(2,5)] with In Grainge et al. (4), several systems of tangle equations were directly repeated sites; such knots are converted to RH cats, and so on, proposed for the pathway taking replication links to two open iteratively, until the reaction stops at two open circles. (In ref. 4, RH torus circles (the unlink). Tangle calculus was used to solve each sys- links with parallel sites and up to 14 crossings, also called parallel 2m-cats tem. For example, all possible systems of two equations con- and denoted by T(2,2m)p, were used as substrates of Xer recombination.) verting a RH 6-cat with parallel sites into a knotted product with five or fewer crossings were considered. Using tangle calculus, recombination. The reactions required DNA translocation by only three biologically meaningful solutions were found, all of which produced the RH 5-crossing torus knot with directly re- FtsK. Overexpression of FtsK50C in TopoIV-deficient cells was sufficient to drive the topology simplification. Furthermore, in peated sites. The authors proposed that the three solutions are fl vivo XerCD activation by actively translocating FtsK is essential equivalent by 3D rigid motion (i.e., the three solutions re ect to effectively unlink replication links (4). In the absence of FtsK, different views of the same 3D shape). This study concluded that the stepwise unlinking pathway of Fig. 1 is the most likely pathway an active XerCD complex may produce complicated DNA knots – and links, with a small yield of unlinks (8). Whereas Xer site-specific of XerCD FtsK recombination when acting on 2m-cats, and recombination on DNA plasmids in vitro has been well-characterized posited a stepwise mechanism of action. at a local biochemical level, the mechanism of Xer-mediated DNA The mathematical study in ref. 4 assumed that solutions to the tangle equations were rational, sums of rational tangles, or closely unlinking in vivo remains unclear, and is extremely technically fi difficult to address experimentally.
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]
  • Intermedia: a System for Linking Multimedia Documents. IRIS
    DOCUMENT RESUME ED 296 735 IR 052 399 AUTHOR Yankelovich, Nicole TITLE Intermedia: A System for Linking Multimrdia Documents. IRIS Technical Report 86-2. INSTITUTION Brown Univ., Providence, RI. Inst. for Research in Information and Scholarship. PUB DATE 86 NOTE 19p. PUB TYPE Reports - Descriptive (141) EDRS PRICE MF01/PC01 Plus Postage. D'1CRIPTORS Bibliographic Coupling; *Computer Assisted Instruction; Computer Graphics; *Computer System Design; Higher Education; *Information Retrieval; *Man Machine Systems; *Multimedia Instruction; Word Processing IDENTIFIERS *Hypermedia ABSTRACT "Intermedia" is a hypermedia system which was developed for use in university research and teaching. It provides a framework for object-oriented, direct manipulation editors and applications, and the capability to link together materials created with those applications. Instructors are able to construct exploratory environments for their students as well as use applications for their day-to-day work, research, and writing. This paper provides a discussion of hypermedia systems in general, as well as a description of the Intermedia system which focuses on several important user features, and illustrates the operation of the system thrw,h a sample session. The text is supplemented by 15 figures. (19 references) (Author/EW) *********************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. *********************************************************************** INTERMEDIA: A System for customizing, visualizing, integratingand 0 Linking Multimedia Documents retrieving information. oi This paper describes Intermedia,one such tool designed for use in theuniversity O Nicole Yankelovich environment. The system, developedat Lid "PERMISSION TO REPRODUCE THIS Brown University's Institute for Researchin MATERIAL HAS BEEN GRANTED BY Information and Scholarship (IRIS),contains U.S.
    [Show full text]
  • Io — I/O Functions
    Title stata.com io — I/O functions Contents Description Remarks and examples Reference Also see Contents [M-5] Manual entry Function Purpose Console output printf( ) printf() display sprintf() display into string errprintf( ) errprintf() display error message display( ) display() display text interpreting SMCL displayas( ) displayas() set whether output is displayed displayflush( ) displayflush() flush terminal output buffer liststruct( ) liststruct() list structure’s contents more( ) more() create --more-- condition setmore() query or set more on or off setmoreonexit() set more on or off on exit File directories direxists( ) direxists() whether directory exists dir( ) dir() file list chdir( ) pwd() obtain current working directory chdir() change current working directory mkdir() make new directory rmdir() remove directory File management findfile( ) findfile() find file fileexists( ) fileexists() whether file exists cat( ) cat() read file into string matrix unlink( ) unlink() erase file adosubdir( ) adosubdir() obtain ado-subdirectory for file 1 2 io — I/O functions File I/O fopen( ) fopen() open file fclose() close file fget() read line of ASCII file fgetnl() same, but include newline character fread() read k bytes of binary file fput() write line into ASCII file fwrite() write k bytes into binary file fgetmatrix() read matrix fputmatrix() write matrix fstatus() status of last I/O command ftell() report location in file fseek() seek to location in file ftruncate() truncate file at current position ferrortext( ) ferrortext() error text of file error code freturncode()
    [Show full text]
  • Version 7.8-Systemd
    Linux From Scratch Version 7.8-systemd Created by Gerard Beekmans Edited by Douglas R. Reno Linux From Scratch: Version 7.8-systemd by Created by Gerard Beekmans and Edited by Douglas R. Reno Copyright © 1999-2015 Gerard Beekmans Copyright © 1999-2015, Gerard Beekmans All rights reserved. This book is licensed under a Creative Commons License. Computer instructions may be extracted from the book under the MIT License. Linux® is a registered trademark of Linus Torvalds. Linux From Scratch - Version 7.8-systemd Table of Contents Preface .......................................................................................................................................................................... vii i. Foreword ............................................................................................................................................................. vii ii. Audience ............................................................................................................................................................ vii iii. LFS Target Architectures ................................................................................................................................ viii iv. LFS and Standards ............................................................................................................................................ ix v. Rationale for Packages in the Book .................................................................................................................... x vi. Prerequisites
    [Show full text]
  • Cygwin User's Guide
    Cygwin User’s Guide Cygwin User’s Guide ii Copyright © Cygwin authors Permission is granted to make and distribute verbatim copies of this documentation provided the copyright notice and this per- mission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this documentation under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this documentation into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Free Software Foundation. Cygwin User’s Guide iii Contents 1 Cygwin Overview 1 1.1 What is it? . .1 1.2 Quick Start Guide for those more experienced with Windows . .1 1.3 Quick Start Guide for those more experienced with UNIX . .1 1.4 Are the Cygwin tools free software? . .2 1.5 A brief history of the Cygwin project . .2 1.6 Highlights of Cygwin Functionality . .3 1.6.1 Introduction . .3 1.6.2 Permissions and Security . .3 1.6.3 File Access . .3 1.6.4 Text Mode vs. Binary Mode . .4 1.6.5 ANSI C Library . .4 1.6.6 Process Creation . .5 1.6.6.1 Problems with process creation . .5 1.6.7 Signals . .6 1.6.8 Sockets . .6 1.6.9 Select . .7 1.7 What’s new and what changed in Cygwin . .7 1.7.1 What’s new and what changed in 3.2 .
    [Show full text]
  • Chapter 19 RECOVERING DIGITAL EVIDENCE from LINUX SYSTEMS
    Chapter 19 RECOVERING DIGITAL EVIDENCE FROM LINUX SYSTEMS Philip Craiger Abstract As Linux-kernel-based operating systems proliferate there will be an in­ evitable increase in Linux systems that law enforcement agents must process in criminal investigations. The skills and expertise required to recover evidence from Microsoft-Windows-based systems do not neces­ sarily translate to Linux systems. This paper discusses digital forensic procedures for recovering evidence from Linux systems. In particular, it presents methods for identifying and recovering deleted files from disk and volatile memory, identifying notable and Trojan files, finding hidden files, and finding files with renamed extensions. All the procedures are accomplished using Linux command line utilities and require no special or commercial tools. Keywords: Digital evidence, Linux system forensics !• Introduction Linux systems will be increasingly encountered at crime scenes as Linux increases in popularity, particularly as the OS of choice for servers. The skills and expertise required to recover evidence from a Microsoft- Windows-based system, however, do not necessarily translate to the same tasks on a Linux system. For instance, the Microsoft NTFS, FAT, and Linux EXT2/3 file systems work differently enough that under­ standing one tells httle about how the other functions. In this paper we demonstrate digital forensics procedures for Linux systems using Linux command line utilities. The ability to gather evidence from a running system is particularly important as evidence in RAM may be lost if a forensics first responder does not prioritize the collection of live evidence. The forensic procedures discussed include methods for identifying and recovering deleted files from RAM and magnetic media, identifying no- 234 ADVANCES IN DIGITAL FORENSICS tables files and Trojans, and finding hidden files and renamed files (files with renamed extensions.
    [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]
  • Dmlite Shell
    DMLite Shell Ivan Calvet CERN IT/SDC-ID 4th DPM Workshop 13th December 2013 Presentation of DMLite Shell . Tool to administrate DMLite . Shell who provides bash-like commands . Made for admins and developers, not for users (root access needed) DMLite Shell – 4th DPM Workshop 13/12/13 2 Under the hood . Developed in Python (2.4) . Based on the python wrapper for DMLite called pydmlite DMLite Shell – 4th DPM Workshop 13/12/13 3 Usage as a command . Execute only one command: . Execute a script: DMLite Shell – 4th DPM Workshop 13/12/13 4 Usage as a shell (1/2) . Launch the shell: . Launch it with a specific configuration: DMLite Shell – 4th DPM Workshop 13/12/13 5 Usage as a shell (2/2) . Auto-completion . Type checking . Syntax checking DMLite Shell – 4th DPM Workshop 13/12/13 6 Commands (1/2) . 41 commands: . 5 to manage the shell: init, help, version, getimplid, exit . 20 to manage files: pwd, cd, ls, mkdir, unlink, rmdir, mv, du, ln, readlink, comment, info, create, chmod, chown, chgrp, checksum, utime, acl, setguid . 3 to manage replicas: replicaadd, replicamodify, replicadel DMLite Shell – 4th DPM Workshop 13/12/13 7 Commands (2/2) . 5 to manage pools: pooladd, poolinfo, poolmodify, pooldel, qryconf . 4 to manage users: useradd, userinfo, userban, userdel . 4 to manage groups: groupadd, groupinfo, groupban, groupdel DMLite Shell – 4th DPM Workshop 13/12/13 8 Demonstration DMLite Shell – 4th DPM Workshop 13/12/13 9 Need help? https://svnweb.cern.ch/trac/lcgdm/wiki/Dpm/Dev/Dmlite/Shell Check the Man page DMLite Shell – 4th DPM Workshop 13/12/13 10 Future improvements .
    [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]
  • 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]
  • 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]
  • CALIFORNIA STATE UNIVERSITY, NORTHRIDGE P-Coloring Of
    CALIFORNIA STATE UNIVERSITY, NORTHRIDGE P-Coloring of Pretzel Knots A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Mathematics By Robert Ostrander December 2013 The thesis of Robert Ostrander is approved: |||||||||||||||||| |||||||| Dr. Alberto Candel Date |||||||||||||||||| |||||||| Dr. Terry Fuller Date |||||||||||||||||| |||||||| Dr. Magnhild Lien, Chair Date California State University, Northridge ii Dedications I dedicate this thesis to my family and friends for all the help and support they have given me. iii Acknowledgments iv Table of Contents Signature Page ii Dedications iii Acknowledgements iv Abstract vi Introduction 1 1 Definitions and Background 2 1.1 Knots . .2 1.1.1 Composition of knots . .4 1.1.2 Links . .5 1.1.3 Torus Knots . .6 1.1.4 Reidemeister Moves . .7 2 Properties of Knots 9 2.0.5 Knot Invariants . .9 3 p-Coloring of Pretzel Knots 19 3.0.6 Pretzel Knots . 19 3.0.7 (p1, p2, p3) Pretzel Knots . 23 3.0.8 Applications of Theorem 6 . 30 3.0.9 (p1, p2, p3, p4) Pretzel Knots . 31 Appendix 49 v Abstract P coloring of Pretzel Knots by Robert Ostrander Master of Science in Mathematics In this thesis we give a brief introduction to knot theory. We define knot invariants and give examples of different types of knot invariants which can be used to distinguish knots. We look at colorability of knots and generalize this to p-colorability. We focus on 3-strand pretzel knots and apply techniques of linear algebra to prove theorems about p-colorability of these knots.
    [Show full text]