DOCSLIB.ORG

Knots, Lassos, and Links

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

KNOTS, LASSOS, AND LINKS pawełdabrowski˛ -tumanski´ Topological manifolds in biological objects June 2019 – version 1.0 [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] PawełD ˛abrowski-Tuma´nski: Knots, lassos, and links, Topological man- ifolds in biological objects, © June 2019 Based on the ClassicThesis LATEXtemplate by André Miede. [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] To my wife, son, and parents. [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] STRESZCZENIE Ła´ncuchybiałkowe opisywane s ˛azazwyczaj w ramach czterorz ˛edowej organizacji struktury. Jednakze,˙ ten sposób opisu nie pozwala na uwzgl ˛ednienieniektórych aspektów geometrii białek. Jedn ˛az braku- j ˛acych cech jest obecno´s´cw˛ezła stworzonego przez ła´ncuchgłówny. Odkrycie białek posiadaj ˛acych taki w˛ezełbudzi pytania o zwijanie takich białek i funkcj ˛ew˛ezła. Pomimo poł˛aczonegopodej´sciateore- tycznego i eksperymentalnego, odpowied´zna te pytania nadal po- zostaje nieuchwytna. Z drugiej strony, prócz zaw˛e´zlonych białek, w ostatnich czasach zostały zidentyfikowane pojedyncze struktury zawie- raj ˛aceinne, topologicznie nietrywialne motywy. Funkcja tych moty- wów i ´sciezka˙ zwijania białek ich zawieraj ˛acych jest równiez˙ nieznana w wi ˛ekszo´sciprzypadków. Ta praca jest pierwszym holistycznym podej´sciemdo całego tematu nietrywialnej topologii w białkach. Prócz białek z zaw˛e´zlonymła´ncu- chem głównym, praca opisuje takze˙ inne motywy: białka-lassa, sploty, zaw˛e´zlonep ˛etlei ✓-krzywe. Niektóre spo´sród tych motywów zostały odkryte w ramach pracy. Wyniki skoncentrowano na klasyfikacji, wys- t ˛epowaniu, funkcji oraz zwijaniu białek z topologicznie nietrywial- nymi motywami. W cz ˛e´scipo´swi˛econejklasyfikacji, zaprezentowane zostały wszys- tkie topologicznie nietrywialne motywy wyst ˛epuj˛acew białkach. W szczególno´sci,zaproponowano i opisano nowe matematyczne narz ˛e- dzia umozliwiaj˙ ˛aceklasyfikacj ˛ebiałek-lass. W cz ˛e´scidotycz ˛acejwys- t ˛epowania struktur rozwazane˙ jest statystyczne prawdopodobie´nstwo wyst ˛epowania róznych˙ motywów. Ich mniejsza liczba w porównaniu z szacunkami wynikaj ˛acymiz modeli polimerowych stanowi wst ˛ep do rozwaza´nna˙ temat funkcji nietrywialnej topologii. W szczegól- no´scipokazano, ze˙ funkcj ˛asplotu jest wprowadzenie szczególnej sta- bilno´sciła´ncucha,a w przypadku niektórych białek topologia lassa jest najprawdopodobniej niezb ˛ednado pełnienia przez nie funkcji. W tej cz ˛e´scizaproponowana została równiez˙ funkcja w˛ezławła´ncuchu głównym, wspomagaj ˛acatworzenie i stabilizuj ˛acamiejsca aktywne enzymów. Nowy mechanizm zwijania zaw˛e´zlonych białek wykorzys- tuj ˛acyrybosom rozpoczyna cz ˛e´s´cczwart ˛a,w której analizowany jest równiez˙ wpływ topologii, ograniczonej obj ˛eto´scii długo´sciw˛ezła na zwijanie białek. Skrupulatna analiza wszystkich dost ˛epnych struktur przestrzen- nych białek mozliwa˙ była jedynie po stworzeniu odpowiednich narz ˛e- dzi programistycznych. Narz ˛edziate zostały przekazane naukowej wspólnocie pod postaci ˛abaz danych, serwerów, wtyczek do innych programów oraz paczki programistycznej. Narz ˛edziate opisane s ˛a w cz ˛e´scipi ˛atej.Praca ko´nczysi ˛ewskazaniem przyszłych kierunków rozwoju dziedziny oraz zbiorem literatury okalaj ˛acejzagadnienia za- warte w pracy. Zestaw ten skierowany jest do przyszłych adeptów, 5 [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] 6 stanowi ˛acprzewodnik po ´swieciebiałek o skomplikowanej topologii i zach ˛et˛edo dalszych prac. [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] ABSTRACT The organization of amino acids in the protein is usually described in terms of four levels of structure classification which, however, misses some important aspects of protein geometry. One of the protein fea- tures absent is the existence of the knot tied on the protein backbone. The discovery of such knotted proteins raises the questions of the folding of such proteins and the function of the backbone knot. De- spite theoretical and experimental investigation, the answers on both of these questions remain elusive. Moreover, apart from the knotted proteins, some singular cases of other topologically non-trivial pro- teins were recently identified, for which the folding and the function are also unknown. This work is the first holistic elaboration on the whole field of the proteins with complex topology. Apart from the backbone knots, the work describes also other motifs, some discovered as the result of the project: complex lassos, protein links, knotted loops, and ✓-curves. The work concentrates on the classification, occurrence, function, and folding of proteins with the topologically complex motifs. In the classification part, all the topologically non-trivial motifs present in proteins are described. In particular, novel mathematical tools to classify the complex lasso structures are proposed. In the part devoted to occurence of the motifs, their statistical probability is presented. Observed underrepresentation of the motifs in comparison with polymer models becomes a prelude to the function of the com- plex topology. In particular, the links are shown to stabilize the struc- ture, and the lasso topology is strongly suggested to be crucial for the function of some proteins. In this part also the enzyme-favoring func- tion of the backbone knot is proposed. The novel, ribosome-based mechanism of folding of the proteins with backbone knots begins the fourth part, in which also the influence of the topology, confinement, and knot tails on folding process is analyzed. The scrupulous analysis of the whole database of the protein struc- tures was possible only with the creation of the special tools. These were given to the broad scientific community in the form of databases, servers, plugins, and a Python package, to which the fifth part of the work is devoted. The work is finalized with the future directions and further reading sections which, hopefully, will inspire younger adepts to immerse into the field of complex topology proteins. 7 [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] PUBLICATIONS The thesis covers the following publications: Dabrowski-Tumanski P, Gren B, Sulkowska JI (2019). Statistical Prop- D1 erties of Lasso-Shape Polymers and Their Implications for Complex Lasso Proteins Function. Polymers, 11(4), 707. Gierut AM, Dabrowski-Tumanski P, Niemyska W, Millett KC, D2 Sulkowska JI (2019). PyLink: a PyMOL plugin to identify links. Bioin- formatics, bty1038 Dabrowski-Tumanski P, Rubach P, Goundaroulis D, Dorier J, Sułkowski P, Millett KC, Rawdon E, Stasiak A, Sulkowska JI (2018). D3 KnotProt 2.0: a database of proteins with knots and other entangled structures. Nucleic acids research, 47(D1), D367–D375. Zaj ˛acS, Geary C, Andersen ES, Dabrowski-Tumanski P, Sulkowska JI, D4 Sułkowski P. (2018). Genus trace reveals the topological complexity and domain structure of biomolecules. Scientific Reports, 8(1), 17537. Dabrowski-Tumanski P, Piejko M, Niewieczerzal S, Stasiak A, Sulkowska JI (2018) Protein Knotting by Active Threading of Nascent D5 Polypeptide Chain Exiting from the Ribosome Exit Channel. The Jour- nal of Physical Chemistry B, 122(49), 11616–11625. Dabrowski-Tumanski P, Sulkowska JI (2018). The APS-bracket–A D6 topological tool to classify lasso proteins, RNAs and other tadpole- like structures. Reactive and Functional Polymers, 132, 19–25. Jarmolinska AI, Kadlof M, Dabrowski-Tumanski P, Sulkowska JI D7 (2018). GapRepairer: a server to model a structural gap and validate it using topological analysis. Bioinformatics, 34(19), 3300–3307. Zhao Y, Dabrowski-Tumanski P, Niewieczerzal S, Sulkowska JI (2018). D8 The exclusive effects of chaperonin on the behavior of proteins with 52 knot. PLoS computational biology, 14(3), e1005970. Dabrowski-Tumanski P, Sulkowska J. (2017). To tie or not to tie? That D9 is the question. Polymers, 9(9), 454. Gierut AM, Niemyska W, Dabrowski-Tumanski P, Sułkowski P, D10 Sulkowska JI (2017). PyLasso: a PyMOL plugin to identify lassos. Bioinformatics, 33(23), 3819–3821. Dabrowski-Tumanski P, Sulkowska JI (2017). Topological knots and D11 links in proteins. Proceedings of the National Academy of Sciences, 114(13), 3415–3420. 9 [ June 25, 2019 at 18:23 – classicthesis version 1.0 ] 10 Dabrowski-Tumanski P, Sklodowski M, Sulkowska JI (2016). Current D12 approaches to disentangle the mystery of knotted protein folding. TASK Quarterly, 20(4), 361–371. Niemyska W, Dabrowski-Tumanski P, Kadlof M, Haglund E, D13 Sułkowski P, Sulkowska JI (2016). Complex lasso: new entangled mo- tifs in proteins. Scientific reports, 6, 36895. Dabrowski-Tumanski P, Stasiak A, Sulkowska JI (2016). In search of D14 functional advantages of knots in proteins. PloS one, 11(11), e0165986. Dabrowski-Tumanski P, Jarmolinska AI, Niemyska W, Rawdon EJ, Millett KC, Sulkowska JI (2016). LinkProt: A database collecting in- D15 formation about biological links. Nucleic acids research, 45(D1), D243— D249. Dabrowski-Tumanski P, Niemyska W, Pasznik P, Sulkowska JI (2016) D16 Lassoprot: server to analyze biopolymers with lassos. Nucleic acids research, 44(W1), W383–W389. Dabrowski-Tumanski P, Jarmolinska AI, Sulkowska JI (2015). Predic- D17 tion of the optimal set of contacts to fold the smallest knotted protein. Journal of Physics: Condensed Matter, 27(35), 354109. Dabrowski-Tumanski P, Niewieczeral S, Sulkowska JI (2014). Deter- D18 mining critical amino acid contacts for knotted protein folding. TASK Quarterly,
Recommended publications
  • The Borromean Rings: a Video About the New IMU Logo

    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/.
  • The Khovanov Homology of Rational Tangles

    The Khovanov Homology of Rational Tangles

    The Khovanov Homology of Rational Tangles Benjamin Thompson A thesis submitted for the degree of Bachelor of Philosophy with Honours in Pure Mathematics of The Australian National University October, 2016 Dedicated to my family. Even though they’ll never read it. “To feel fulfilled, you must first have a goal that needs fulfilling.” Hidetaka Miyazaki, Edge (280) “Sleep is good. And books are better.” (Tyrion) George R. R. Martin, A Clash of Kings “Let’s love ourselves then we can’t fail to make a better situation.” Lauryn Hill, Everything is Everything iv Declaration Except where otherwise stated, this thesis is my own work prepared under the supervision of Scott Morrison. Benjamin Thompson October, 2016 v vi Acknowledgements What a ride. Above all, I would like to thank my supervisor, Scott Morrison. This thesis would not have been written without your unflagging support, sublime feedback and sage advice. My thesis would have likely consisted only of uninspired exposition had you not provided a plethora of interesting potential topics at the start, and its overall polish would have likely diminished had you not kept me on track right to the end. You went above and beyond what I expected from a supervisor, and as a result I’ve had the busiest, but also best, year of my life so far. I must also extend a huge thanks to Tony Licata for working with me throughout the year too; hopefully we can figure out what’s really going on with the bigradings! So many people to thank, so little time. I thank Joan Licata for agreeing to run a Knot Theory course all those years ago.
  • Complete Invariant Graphs of Alternating Knots

    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
  • Arxiv:1006.4176V4 [Math.GT] 4 Nov 2011 Nepnigo Uho Ntter.Freape .W Alexander Mo W

    Arxiv:1006.4176V4 [Math.GT] 4 Nov 2011 Nepnigo Uho Ntter.Freape .W Alexander Mo W

    UNKNOTTING UNKNOTS A. HENRICH AND L. KAUFFMAN Abstract. A knot is an an embedding of a circle into three–dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of unknotting a knot diagram when we know that it is unknotted. This problem is surprisingly difficult, since it has been shown that knot diagrams may need to be made more complicated before they may be simplified. We do not yet know, however, how much more complicated they must get. We give an introduction to the work of Dynnikov who discovered the key use of arc–presentations to solve the problem of finding a way to de- tect the unknot directly from a diagram of the knot. Using Dynnikov’s work, we show how to obtain a quadratic upper bound for the number of crossings that must be introduced into a sequence of unknotting moves. We also apply Dynnikov’s results to find an upper bound for the number of moves required in an unknotting sequence. 1. Introduction When one first delves into the theory of knots, one learns that knots are typically studied using their diagrams. The first question that arises when considering these knot diagrams is: how can we tell if two knot diagrams represent the same knot? Fortunately, we have a partial answer to this question. Two knot diagrams represent the same knot in R3 if and only if they can be related by the Reidemeister moves, pictured below.
  • Notes on the Self-Linking Number

    Notes on the Self-Linking Number

    NOTES ON THE SELF-LINKING NUMBER ALBERTO S. CATTANEO The aim of this note is to review the results of [4, 8, 9] in view of integrals over configuration spaces and also to discuss a generalization to other 3-manifolds. Recall that the linking number of two non-intersecting curves in R3 can be expressed as the integral (Gauss formula) of a 2-form on the Cartesian product of the curves. It also makes sense to integrate over the product of an embedded curve with itself and define its self-linking number this way. This is not an invariant as it changes continuously with deformations of the embedding; in addition, it has a jump when- ever a crossing is switched. There exists another function, the integrated torsion, which has op- posite variation under continuous deformations but is defined on the whole space of immersions (and consequently has no discontinuities at a crossing change), but depends on a choice of framing. The sum of the self-linking number and the integrated torsion is therefore an invariant of embedded curves with framings and turns out simply to be the linking number between the given embedding and its small displacement by the framing. This also allows one to compute the jump at a crossing change. The main application is that the self-linking number or the integrated torsion may be added to the integral expressions of [3] to make them into knot invariants. We also discuss on the geometrical meaning of the integrated torsion. 1. The trivial case Let us start recalling the case of embeddings and immersions in R3.
  • Gauss' Linking Number Revisited

    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.
  • Tait's Flyping Conjecture for 4-Regular Graphs

    Tait's Flyping Conjecture for 4-Regular Graphs

    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Journal of Combinatorial Theory, Series B 95 (2005) 318–332 www.elsevier.com/locate/jctb Tait’s flyping conjecture for 4-regular graphs Jörg Sawollek Fachbereich Mathematik, Universität Dortmund, 44221 Dortmund, Germany Received 8 July 1998 Available online 19 July 2005 Abstract Tait’s flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S3. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes with respect to ambient isotopy and rigid vertex isotopy of graph embeddings are identical on the class of diagrams considered. © 2005 Elsevier Inc. All rights reserved. Keywords: Knotted graph; Alternating diagram; Flyping conjecture 0. Introduction Very early in the history of knot theory attention has been paid to alternating diagrams of knots and links. At the end of the 19th century Tait [21] stated several famous conjectures on alternating link diagrams that could not be verified for about a century. The conjectures concerning minimal crossing numbers of reduced, alternating link diagrams [15, Theorems A, B] have been proved independently by Thistlethwaite [22], Murasugi [15], and Kauffman [6]. Tait’s flyping conjecture, claiming that two reduced, alternating, prime diagrams of a given link can be connected by a finite sequence of so-called flypes (see [4, p. 311] for Tait’s original terminology), has been shown by Menasco and Thistlethwaite [14], and for a special case, namely, for well-connected diagrams, also by Schrijver [20].
  • Knots: a Handout for Mathcircles

    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

    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.
  • Dehn Filling of the “Magic” 3-Manifold

    Dehn Filling of the “Magic” 3-Manifold

    communications in analysis and geometry Volume 14, Number 5, 969–1026, 2006 Dehn filling of the “magic” 3-manifold Bruno Martelli and Carlo Petronio We classify all the non-hyperbolic Dehn fillings of the complement of the chain link with three components, conjectured to be the smallest hyperbolic 3-manifold with three cusps. We deduce the classification of all non-hyperbolic Dehn fillings of infinitely many one-cusped and two-cusped hyperbolic manifolds, including most of those with smallest known volume. Among other consequences of this classification, we mention the following: • for every integer n, we can prove that there are infinitely many hyperbolic knots in S3 having exceptional surgeries {n, n +1, n +2,n+3}, with n +1,n+ 2 giving small Seifert manifolds and n, n + 3 giving toroidal manifolds. • we exhibit a two-cusped hyperbolic manifold that contains a pair of inequivalent knots having homeomorphic complements. • we exhibit a chiral 3-manifold containing a pair of inequivalent hyperbolic knots with orientation-preservingly homeomorphic complements. • we give explicit lower bounds for the maximal distance between small Seifert fillings and any other kind of exceptional filling. 0. Introduction We study in this paper the Dehn fillings of the complement N of the chain link with three components in S3, shown in figure 1. The hyperbolic structure of N was first constructed by Thurston in his notes [28], and it was also noted there that the volume of N is particularly small. The relevance of N to three-dimensional topology comes from the fact that by filling N, one gets most of the hyperbolic manifolds known and most of the interesting non-hyperbolic fillings of cusped hyperbolic manifolds.
  • Knots, Links, Spatial Graphs, and Algebraic Invariants

    Knots, Links, Spatial Graphs, and Algebraic Invariants

    689 Knots, Links, Spatial Graphs, and Algebraic Invariants AMS Special Session on Algebraic and Combinatorial Structures in Knot Theory AMS Special Session on Spatial Graphs October 24–25, 2015 California State University, Fullerton, CA Erica Flapan Allison Henrich Aaron Kaestner Sam Nelson Editors American Mathematical Society 689 Knots, Links, Spatial Graphs, and Algebraic Invariants AMS Special Session on Algebraic and Combinatorial Structures in Knot Theory AMS Special Session on Spatial Graphs October 24–25, 2015 California State University, Fullerton, CA Erica Flapan Allison Henrich Aaron Kaestner Sam Nelson Editors American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Dennis DeTurck, Managing Editor Michael Loss Kailash Misra Catherine Yan 2010 Mathematics Subject Classification. Primary 05C10, 57M15, 57M25, 57M27. Library of Congress Cataloging-in-Publication Data Names: Flapan, Erica, 1956- editor. Title: Knots, links, spatial graphs, and algebraic invariants : AMS special session on algebraic and combinatorial structures in knot theory, October 24-25, 2015, California State University, Fullerton, CA : AMS special session on spatial graphs, October 24-25, 2015, California State University, Fullerton, CA / Erica Flapan [and three others], editors. Description: Providence, Rhode Island : American Mathematical Society, [2017] | Series: Con- temporary mathematics ; volume 689 | Includes bibliographical references. Identifiers: LCCN 2016042011 | ISBN 9781470428471 (alk. paper) Subjects: LCSH: Knot theory–Congresses. | Link theory–Congresses. | Graph theory–Congresses. | Invariants–Congresses. | AMS: Combinatorics – Graph theory – Planar graphs; geometric and topological aspects of graph theory. msc | Manifolds and cell complexes – Low-dimensional topology – Relations with graph theory. msc | Manifolds and cell complexes – Low-dimensional topology – Knots and links in S3.msc| Manifolds and cell complexes – Low-dimensional topology – Invariants of knots and 3-manifolds.
  • Electricity Demand Evolution Driven by Storm Motivated Population

    Electricity Demand Evolution Driven by Storm Motivated Population

    aphy & N r at og u e ra G l Allen et al., J Geogr Nat Disast 2014, 4:2 f D o i s l a Journal of a s DOI: 10.4172/2167-0587.1000126 n t r e u r s o J ISSN: 2167-0587 Geography & Natural Disasters ResearchResearch Article Article OpenOpen Access Access Electricity Demand Evolution Driven by Storm Motivated Population Movement Melissa R Allen1,2, Steven J Fernandez1,2*, Joshua S Fu1,2 and Kimberly A Walker3 1University of Tennessee, Knoxville, Oak Ridge, USA 2Oak Ridge National Laboratory, Oak Ridge, USA 3Indiana University, Oak Ridge, USA Abstract Managing the risks to reliable delivery of energy to vulnerable populations posed by local effects of climate change on energy production and delivery is a challenge for communities worldwide. Climate effects such as sea level rise, increased frequency and intensity of natural disasters, force populations to move locations. These moves result in changing geographic patterns of demand for infrastructure services. Thus, infrastructures will evolve to accommodate new load centers while some parts of the network are underused, and these changes will create emerging vulnerabilities. Forecasting the location of these vulnerabilities by combining climate predictions and agent based population movement models shows promise for defining these future population distributions and changes in coastal infrastructure configurations. In this work, we created a prototype agent based population distribution model and developed a methodology to establish utility functions that provide insight about new infrastructure vulnerabilities that might result from these new electric power topologies. Combining climate and weather data, engineering algorithms and social theory, we use the new Department of Energy (DOE) Connected Infrastructure Dynamics Models (CIDM) to examine electricity demand response to increased temperatures, population relocation in response to extreme cyclonic events, consequent net population changes and new regional patterns in electricity demand.