KNOT CLASSIFICATION AND INVARIANCE
|
|
- Sylvia Ball
- 5 years ago
- Views:
Transcription
1 KNOT CLASSIFICATION AND INVARIANCE ELEANOR SHOSHANY ANDERSON Abstract. A key concern of knot theory is knot equivalence; effective representation of these objects through various notation systems is another. This paper will look at these areas intersection. It will examine several systems used to describe knots, stressing three questions: (a) Do non-equivalent knots have different designations under each system (i.e does each system classify knots), (b) Do equivalent knots have the same designation under each system (i.e. is the system a knot invariant), and (c) If the answer to (a) or (b) is generally no, under what conditions does it become yes? Contents List of Figures 1 1. Mathematical Introduction to Knots 2 2. Planar Projections 3 3. Dowker Notation 4 4. Braid Notation 6 Acknowledgments 9 References 9 Figures 9 List of Figures 1 Three knots 9 2 Wild knot 10 3 Unknot equivalent 10 4 Knot and projection 10 5 Type I Reidemeister move 11 6 Type II Reidemeister move 11 7 Type III Reidemeister move 11 8 Tricolorability 12 9 Type II preserves tricolorability Type III preserves tricolorability Unknot equivalent Generating Dowker notation Diagramming from Dowker notation Same Dowker notation Composite knot 17 1
2 2 ELEANOR SHOSHANY ANDERSON 16 Equivalent Dowker notation Same Dowker notation Equivalent knots Braid and braid frame Braid as projection Labeling for braid representation Ambient isotopy for braid representation Eliminating superfluous arcs Equivalent braids Equivalent braids Mathematical Introduction to Knots Definition 1.1. A knot is an embedding of the circle in 3-space. By Definition, one of the easiest ways to construct a mathematical knot is tie two ends of a string together. Figure 4 makes use of this to show three knots ranging from the simple knot called the unknot (a) to an apparently complex knot (c). Under Definition 1, Figure 2, which shows a knot with infinitely many crossings (the infinitude is represent by the ellipsis), due to R.H. Fox, is a knot. This is called a wild knot because, informally speaking, it would take infinitely many uncrossings to undo it. We wish to rule out this sort of behavior. Definition 1.2. An ambient isotopy of a knot K is a continuous deformation of K in R 3 so that at any time the image of K is an embedded circle. Definition 1.3. A knot is called tame if it is ambient isotopic to a simple closed polygon in R 3. Note that Definition 1.3 rules out Fox s knot example because a polygon has only finitely many sides. Henceforward, this paper will consider only tame knots, and we say that two knots are equivalent if one can be changed into the other by means of an ambient isotopy. Figure 3 shows a knot equivalent to the unknot. Because every tame knot is ambiently isotopic to a simple closed polygon, we can speak of each tame knot K being defined by the set {p 1,..., p n }, where the union of the line segments [p 1, p 2 ],..., [p n 1, p n ] and [p n, p 1 ] form a closed polygon isotopic to K. Note that this choice is not unique, as many polygons are isotopic to each other. Definition 1.4. The points p 1,..., p n, defined as above, are called the vertices of K.
3 KNOT CLASSIFICATION AND INVARIANCE 3 In the next three sections of this paper, we will examine three systems of knot notation and see to what degree they classify (i.e. whether they distinguish nonequivalent knots) or act as invariants for knots (i.e. whether they assign the same notation to equivalent knots). 2. Planar Projections Planar projections, also called knot projections and knot diagrams, are extremely important because they give visually accurate representations of knots. Figure 4 shows a knot (a) and its planar projection (b). The parts where it overlaps itself are called overcrossings and undercrossings; the choice of term depends on our perspective. Definition 2.1. A projection is a map R 3 R 2. Definition 2.2. Consider a knot K represented by a polygonal embedding and a projection P : R 3 R 2. A point p P (K) is called a multiple point of P if P 1 (p) contains more than one point and a double point of P if P 1 (p) contains exactly two points. Definition 2.3. A projection P : R 3 R 2 is a planar projection of a knot K if (1) There are only finitely many multiple points of P ; (2) Each multiple point of P is a double point of P ; (3) No vertices of K are mapped to double points; (4) The over- and under-crossing lines of each double point are marked. We will first show that planar projections classify knots. To do so, we introduce the three Reidemeister moves and their inverses, vital methods of diagram manipulation. Definition 2.4. A Reidemeister move is a transformation of of a planar projection. The three types of move are shown in Figures 5, 6, and 7. Definition 2.5. Two planar projections are called equivalent if one can be changed into the other by a finite number of Reidemeister moves. The next theorem shows why Reidemeister moves are so important, and why we can claim that planar projections offer accurate physical representations of knots. Theorem 2.6. Two knots are equivalent if and only if all of their planar projections are equivalent. The proof of this theorem can be found in [4]. While useful, it does not give any upper bound on the number of Reidemeister moves needed to show equivalence; in fact, no such bound is known. We also have not shown that there exists more than one equivalence class of knots. To do so, we introduce the idea of tricolorability, and apply the Reidemeister moves to this concept. Definition 2.7. A strand in a projection of knot is a segment of curve spanning from under-crossing to under-crossing, with only over-crossings in between. Definition 2.8. A knot projection is tricolorable if it meets the following criteria: (1) Each of its strands can be colored in one of three colors;
4 4 ELEANOR SHOSHANY ANDERSON (2) Either one or three colors come together at each crossing; (3) At least two colors are used. The unknot in Figure 8(a) violates Item 3 of Definition 2.8. The knot in Figure 8(b) (called the trefoil knot) is tricolorable. As Figures 9 and 10 show, Type II and III Reidemeister moves preserve tricolorability regardless of the strands coloring; a Type I Reidemeister move does so because only one strand is involved. Since the trefoil is tricolorable and the unknot is not, the unknot s diagram is not equivalent to the trefoil s, and so by Theorem 2.6, the unknot is not equivalent to the trefoil. This shows there are non-equivalent knots. Although planar projections classify, they are only invariants of knots up to equivalence by Reidemeister moves. Figure 11 shows a diagram of knot K which, with a single Type I Reidemeister move, becomes the unknot s diagram. Thus, though K and the unknot have different diagrams, by Theorem 2.6 the knots are equivalent. 3. Dowker Notation For many applications, such as inputting the data of a knot into a computer, pictures are insufficient. Dowker notation, which reduces any knot to a string of integers, is useful for this; so useful, in fact, that in 1998 Morwen Thistlethwaite used it to list all knots of fewer than fourteen crossings [5]. Here is how to generate Dowker notation from a knot. Take a projection and choose any crossing, and label the under-strand with a 1. Pick a direction in which to follow that strand. At the next crossing, label that strand with a 2. Continue following the same strand in the same direction, labeling the strands consecutively, until arriving back at 1. The result should look like Figure 12. Notice that each of this figure s crossings is denoted by one odd and one even integer. In fact, this will always be the case. Theorem 3.1. Each crossing of any knot labeled in the Dowker style will always be denoted by one even and one odd integer. Proof. Consider a loop L of a knot diagram created by a crossing labeled by two odd numbers or two even numbers. Because the overstrand and understrand are of the same parity, this means that strictly between them is an odd number of crossings between the two along L. (For example, if the crossing creating L is labeled 2 6, then the crossings labeled 3, 4, and 5 are between 2 and 6.) This, however, is impossible. Since L is a closed curve, each segment that enters L must also leave it, producing an even number of crossings. Thus no such loop L can exist; consequently all crossings must be labeled with one even and one odd integer. We can thus pair the even and odd integers and list them like so, using Figure 12 as an example and + and to show whether each strand goes over or under:
5 KNOT CLASSIFICATION AND INVARIANCE 5 Since each pair has one + and one (as every crossing consists of one overand one under-stand), and since the top row goes in a predictable order, we can eliminate it. Thus in Dowker notation Figure 12 is called It is also possible to (re)construct a knot from Dowker notation. As an illustration, we do this with the following example: First, we know that each integer in the notation must be matched to its even partner, and that partner must have the opposite sign. Thus this Dowker notation is shorthand for Begin by drawing the first crossing, labeling it 1 and 4, like Figure 13(a); make sure the 1 strand goes under the 4 strand. Continue on, drawing crossings and labeling them accordingly. When an integer is reached which has already been used to label a crossing, circle back and pass through that crossing on the already-labeled strand, then continue creating crossings as needed; be careful not to create extra crossings. Figure 13(b) shows this process in action. Finally, when all crossings have been made, loop the two ends together. Figure 13(c) shows the complete knot. One problem with Dowker notation is that non-equivalent knots can have the same Dowker notation. Two examples of this problem, are discussed below. To understand the first, here are two definitions. Definition 3.2. The mirror image of a knot K is the knot obtained by changing K s over-crossings to under-crossings and vice versa. Definition 3.3. A knot is amphicheiral if it is equivalent to its mirror image. One problem, as shown in Figure 14, is that there are two ways to loop back to an already-used integer: these loops can go either up or down, resulting in a knot and its mirror image. In fact, these two knots are the trefoil knot and its mirror image, which Max Dehn [3] showed are not equivalent. A second problem with Dowker notation arises from mirror-image complications with composite knots. Definition 3.4. Suppose that K 1 and K 2 are knot embeddings meeting a plane E only along the arc from p to q. Remove this arc from both knots to and join them together at p and q to form a new knot K, which is called the composition of K 1 and K 2 and denoted K = K 1 #K 2. Figure 15 illustrates this. Definition 3.5. A knot is called composite if it is the composition of two knots, neither of which are the unknot. A knot K is called prime if the only decomposition K = K 1 #K 2 of it has K 1 or K 2 as the unknot. When Dowker notation strings include subpermutations of the even numbers (e.g , where is a subpermutation of and is a subpermutation of ), the result is a composite knot. This is because the first subpermutation forms one knot, complete but for the closing,
6 6 ELEANOR SHOSHANY ANDERSON and the latter subpermutations produce others. Figure 16 shows that completely describes a knot (call it Knot A) in Dowker notation, and, if we label our crossing beginning with -7, then completely describes another knot (Knot B) in Dowker notation. Figure 16 shows these knots with their ends unclosed, to show how A might attach to B. As discussed above, both strings of notation can result in a knot and its mirror image. When composing the two strings together to make the knot , therefore, we have four choices: (1) We can join Knot A to Knot B; (2) We can join Knot A to Knot B s mirror image; (3) We can join Knot A s mirror image to Knot B; (4) We can join Knot A s mirror image to Knot B s mirror image. The results of option 1 and option 2 are given in Figure 17; Adams [1] shows these are not equivalent knots. These problems outline the restrictions necessary for Dowker notation to be used for classification. If knots described by Dowker notation including subpermutations i.e. composite knots are excluded, a particular string of notation may describe only a knot and its mirror image [1]. So, restricting ourselves to prime amphicheiral knots allows Dowker notation to be used for classification. With exactly these restrictions, Thistlethwaite was able to make great use of Dowker notation. However, it is not as useful as an invariant. Figure 18 shows diagrams of equivalent knots (to get from the left one to the right, simply perform one Type I Reidemeister move). The top diagram is denoted +2; the bottom is denoted Thus, while Dowker notation with several restrictions is a very useful classifier, it is useless as an invariant. 4. Braid Notation A particularly beautiful way of representing knots is by using braid notation. First, we describe braids and their properties; then we examine braid notation. Definition 4.1. Let ABCD be a rectangle in R 3 with points P 1,..., P n on side A and Q 1,..., Q n arranged on side C. For each i with 1 i < n, P i+1 P i = Q i+1 Q i, and P 1 and Q 1 are equal distance from side B. Let s i, 1 i n, be simple disjoint arcs from P i to Q π(i), where i π(i) is a bijective function from {1,..., n} to itself. This function must also not have any subpermutations of {1,..., n} in the sequence {π n (1)}, because these would result in multiple disjoint knots, collectively called a link. Each s i meets any plane perpendicular to sides B and D exactly once. When we identify each P i with its respective Q i, we call the set {s i } a braid. Rectangle ABCD is called the braid frame. Example 4.2. Figure 19 shows a representation of a braid with its braid frame. Keep in mind that each P i is identified with its respective Q i, and that in a twodimensional representation, we must indicate which strand crosses which. Figure 20 shows another drawing of a braid, with the long strings around the sides showing the identification of the top and bottom of the braid frame. We will
7 KNOT CLASSIFICATION AND INVARIANCE 7 continue to depict braids as in Figure 19, because it is more convenient to leave out the long looping strings, but this picture shows that this braid representation is a valid knot projection, and so by Theorem 2.6, it corresponds to a knot. This shows that at least the knot corresponding to Figure 20 can be represented as a braid. Our next goal is to show that in fact all knots can so represented. First, three helpful definitions are given below. Definition 4.3. A braid B is closed if there is a choice of axis A perpendicular to the plane formed by the braid frame such that, starting from point S on B, B can be traversed clockwise about A without backtracking, and arriving back at S. Definition 4.4. A maximal overpass of a knot diagram is a subarc of the diagram going over at least one crossing and terminating on each end at undercrossings, but not including the undercrossings. A minimal underpass of a knot diagram is a subarc of the diagram going from overcrossing to overcrossing, without including the overcrossings. Note that by the definition of maximal overpass, as we traverse any projection of a knot, we must alternate maximal overpasses and minimal underpasses. Thus the number of maximal overpasses equals the number of minimal underpasses. Definition 4.5. The bridge number of a knot is the least number of maximal overpasses found in any projection of the knot. Theorem 4.6. Any knot can be represented as a closed braid. Proof. Consider some projection P of some knot K. Suppose P has m maximal overpasses. Choosing two points on each maximal overpass gives the 2m points R 1,..., R 2m, with, for 1 i m, arc s i connecting R 2i 1 and R 2i, and arc t i connecting R 2i and R 2i+1. Note that the crossings made by each segment s i are overpasses and those made by each t i are underpasses, and that there are m s i and m t i. An example of this labeling is given by Figure 21. By ambient isotopy we can arrange the t i to form m straight parallel segments bisected by segment A; this rearrangement is shown by Figure 22. Now, each s i meets A an odd number of times (since each starts at R 2i 1 and ends at R 2i, each s i must begin on one side of A and end on the other); call these meeting points R i1, R i2,.... As things stand, the s i may cross a more than once. Thus we take all subarcs of each s i above A aside from the one connected to R 2i 1 and push them below A by ambient isotopy, as shown in Figure 23. Now each s i and each t i meets A at exactly one point. Now, we can eliminate the t i from our representation, instead identifying R 2i with R 2i+1 for 1 i m, since these are the points connected by t i. The result is exactly a braid as defined by Definition 4.3. Notation for a braid on n strands is given by the symbols σ1, 1..., σn 1 and σ1 1,..., σ 1 n.. means that the ith strand (counting from the left) crosses in front The symbol σ +1 i of the (i + 1)th strand; the symbol σ 1 i means that the ith strand crosses behind the (i + 1)th strand. The crossings are read from top to bottom, and the sequence of sigmas describing this reading are called the braid s word. For example, Figure
8 8 ELEANOR SHOSHANY ANDERSON 19 s word is σ 1 σ 2. Because of Theorem 4, we see that braid notation does classify knots. If two braids have the same word, their braid representations will be ambiently isotopic to each other. Since, as noted above, these braid representations are knot diagrams, and since knot diagrams classify knots, we see that braid notation classifies knots. However, braid words are not knot invariants. Figure 24 shows two braids between which an isotopy clearly exists informally, one must simply pull up the first crossing and push down the second crossing in (a) to attain (b) making them equivalent knot diagrams, and hence equivalent knots. However, just like Reidemeister moves for projections, there are three rules for word equivalence; these are called the equivalence moves, and in fact the first two derive from the Reidemeister moves. First, one Type II Reidemeister move removes any part of a word with σ i σ 1 i or σ 1 i σ i, since these simply denote a strand crossing over or under its neighbor twice in succession. Figure 25 describes the second equivalence move: it shows, by applying a Type III Reidemeister move that segments of words denoted by σ i σ i+1 σ i are equivalent to the segment σ i+1 σ i σ i+1. Note that the strands initial and final positions are unchanged, which is why this move is acceptable. The third equivalence move comes not from the Reidemeister moves, but makes use of what Figure 24 shows: if the ith and jth strands from the left are separated by at least one strand, and the braid s word contains the segment σ i σ j, then that segment can be replaced by σ j σ i. As noted above, this is simply an ambient isotopy. These three equivalence moves completely describe braid-word equivalence: Theorem 4.7. Two braids words represent the same knot if and only if we can get from one word to the other by a sequence of the above three equivalence moves. Proof. First, suppose words w and x represent projections P and Q of knot K, respectively. By Theorem 2.6, we can thus get from P to Q by a series of Reidemeister moves. If Type I moves are used, this will not affect w, as a braid word only notes when separate strands cross. If Type II moves are used, they alter the w by the first equivalence move, which is acceptable. If Type II moves are used, w will be altered by the second equivalence move, which is also acceptable. Also, any ambient isotopies performed during the Reidemeister sequence are acceptable, because this is the third equivalence move. To show the converse, suppose braid words w and x are linked by a sequence of equivalence moves. Since each equivalence move is composed only of Reidemeister moves and ambient isotopies, the knots represented by w and x are linked by a sequence of Reidemeister moves and ambient isotopies, and so by Theorem 2.6, the two knots are equivalent.
9 KNOT CLASSIFICATION AND INVARIANCE 9 Acknowledgments It is a pleasure to thank my mentors, William Lopes and Katie Mann, for their enthusiasm, guidance, and great knowledge. Thanks also to my mother, Gila Shoshany, for her great help in producing such elegant figures. References [1] Colin Adams. The Knot Book. American Mathematical Society [2] Gerhard Burde and Heiner Zieschang. Knots, Second Edition. De Gruyter Studies in Mathematics [3] Max Dehn. Die beiden Kleeblattschlingen. Mathematische Annalen Volume 75, Number 3, [4] Lou Kauffman. Knot Diagrammatics. In Handbook of Knot Theory, ed. W. Menasco and M. Thistlethwaite, [5] Morwen Thistlethwaite et al. The First 1,701,396 Knots. Math Intelligencer Volume 20, Number Figures Figure 1. Three knots
10 10 ELEANOR SHOSHANY ANDERSON Figure 2. Wild knot Figure 3. Unknot equivalent Figure 4. Knot and projection
11 KNOT CLASSIFICATION AND INVARIANCE 11 Figure 5. Type I Reidemeister move Figure 6. Type II Reidemeister move Figure 7. Type III Reidemeister move
12 12 ELEANOR SHOSHANY ANDERSON Figure 8. Tricolorability Figure 9. Type II preserves tricolorability
13 KNOT CLASSIFICATION AND INVARIANCE 13 Figure 10. Type III preserves tricolorability
14 14 ELEANOR SHOSHANY ANDERSON Figure 11. Unknot equivalent Figure 12. Generating Dowker notation
15 KNOT CLASSIFICATION AND INVARIANCE 15 Figure 13. Diagramming from Dowker notation
16 16 ELEANOR SHOSHANY ANDERSON Figure 14. Same Dowker notation
17 KNOT CLASSIFICATION AND INVARIANCE 17 Figure 15. Composite knot Figure 16. Equivalent Dowker notation
18 18 ELEANOR SHOSHANY ANDERSON Figure 17. Same Dowker notation
19 KNOT CLASSIFICATION AND INVARIANCE 19 Figure 18. Equivalent knots
20 20 ELEANOR SHOSHANY ANDERSON Figure 19. Braid and braid frame
21 KNOT CLASSIFICATION AND INVARIANCE 21 Figure 20. Braid as projection
22 22 ELEANOR SHOSHANY ANDERSON Figure 21. Labeling for braid representation
23 KNOT CLASSIFICATION AND INVARIANCE 23 Figure 22. Ambient isotopy for braid representation
24 24 ELEANOR SHOSHANY ANDERSON Figure 23. Eliminating superfluous arcs Figure 24. Equivalent braids Figure 25. Equivalent braids
COMPOSITE KNOT DETERMINANTS
COMPOSITE KNOT DETERMINANTS SAMANTHA DIXON Abstract. In this paper, we will introduce the basics of knot theory, with special focus on tricolorability, Fox r-colorings of knots, and knot determinants.
More informationAN OVERVIEW OF KNOT INVARIANTS
AN OVERVIEW OF KNOT INVARIANTS WILL ADKISSON ABSTRACT. The central question of knot theory is whether two knots are isotopic. This question has a simple answer in the Reidemeister moves, a set of three
More informationFACTORING POSITIVE BRAIDS VIA BRANCHED MANIFOLDS
Submitted to Topology Proceedings FACTORING POSITIVE BRAIDS VIA BRANCHED MANIFOLDS MICHAEL C. SULLIVAN Abstract. We show that a positive braid is composite if and only if the factorization is visually
More informationGeneralized Knot Polynomials and An Application
Generalized Knot Polynomials and An Application Greg McNulty March 17, 2005 ABSTRACT: In this paper we introduce two generalized knot polynomials, the Kauffman and HOMFLY polynomials, show that they are
More informationABSTRACT A STUDY OF PROJECTIONS OF 2-BOUQUET GRAPHS. A new field of mathematical research has emerged in knot theory,
ABSTRACT A STUDY OF PROJECTIONS OF -BOUQUET GRAPHS A new field of mathematical research has emerged in knot theory, which considers knot diagrams with missing information at some of the crossings. That
More informationComposing Two Non-Tricolorable Knots
Composing Two Non-Tricolorable Knots Kelly Harlan August 2010, Math REU at CSUSB Abstract In this paper we will be using modp-coloring, determinants of coloring matrices and knots, and techniques from
More informationThe Three-Variable Bracket Polynomial for Reduced, Alternating Links
Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 2 Article 7 The Three-Variable Bracket Polynomial for Reduced, Alternating Links Kelsey Lafferty Wheaton College, Wheaton, IL, kelsey.lafferty@my.wheaton.edu
More informationarxiv: v2 [math.gt] 17 May 2018
FAMILIES OF NOT PERFECTLY STRAIGHT KNOTS arxiv:1804.04799v2 [math.gt] 17 May 2018 NICHOLAS OWAD Abstract. We present two families of knots which have straight number higher than crossing number. In the
More informationMATH CIRCLE HIGH SCHOOL 2 GROUP, WINTER 2018 WEEK 3: QUANDLES AND KNOT INVARIANTS
MATH CIRCLE HIGH SCHOOL 2 GROUP, WINTER 2018 WEEK 3: QUANDLES AND KNOT INVARIANTS DON LAACKMAN 1. Quandles Definition. A Quandle is a set Q with two binary operations, and (which I will pronounce quandle
More informationDIAGRAM UNIQUENESS FOR HIGHLY TWISTED PLATS. 1. introduction
DIAGRAM UNIQUENESS FOR HIGHLY TWISTED PLATS YOAV MORIAH AND JESSICA S. PURCELL Abstract. Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number c grows
More informationA brief Incursion into Knot Theory. Trinity University
A brief Incursion into Knot Theory Eduardo Balreira Trinity University Mathematics Department Major Seminar, Fall 2008 (Balreira - Trinity University) Knot Theory Major Seminar 1 / 31 Outline 1 A Fundamental
More informationBRAID GROUPS ALLEN YUAN. 1. Introduction. groups. Furthermore, the study of these braid groups is also both important to mathematics
BRAID GROUPS ALLEN YUAN 1. Introduction In the first lecture of our tutorial, the knot group of the trefoil was remarked to be the braid group B 3. There are, in general, many more connections between
More informationCLASSIFYING AND APPLYING RATIONAL KNOTS AND RATIONAL TANGLES
CLASSIFYING AND APPLYING RAIONAL KNOS AND RAIONAL ANGLES LOUIS H. KAUFFMAN AND SOFIA LAMBROPOULOU Abstract. In this survey paper we sketch new combinatorial proofs of the classification of rational tangles
More informationThe Satellite crossing number conjecture for cables of knots
The Satellite crossing number conjecture for cables of knots Alexander Stoimenow Department of Mathematical Sciences, KAIST April 25, 2009 KMS Meeting Aju University Contents Crossing number Satellites
More informationThe Knot Quandle. Steven Read
The Knot Quandle Steven Read Abstract A quandle is a set with two operations that satisfy three conditions. For example, there is a quandle naturally associated to any group. It turns out that one can
More informationFrom Tangle Fractions to DNA
From angle Fractions to DNA Louis H. Kauffman and Sofia Lambropoulou Abstract his paper draws a line from the elements of tangle fractions to the tangle model of DNA recombination. In the process, we sketch
More informationTemperley Lieb Algebra I
Temperley Lieb Algebra I Uwe Kaiser Boise State University REU Lecture series on Topological Quantum Computing, Talk 3 June 9, 2011 Kauffman bracket Given an oriented link diagram K we define K Z[A, B,
More informationClassifying and Applying Rational Knots and Rational Tangles
Contemporary Mathematics Classifying and Applying Rational Knots and Rational angles Louis H. Kauffman and Sofia Lambropoulou Abstract. In this survey paper we sketch new combinatorial proofs of the classification
More informationKnot Theory and the Alexander Polynomial
Knot Theory and the Alexander Polynomial Reagin Taylor McNeill Submitted to the Department of Mathematics of Smith College in partial fulfillment of the requirements for the degree of Bachelor of Arts
More informationKnot Just Another Math Article
Knot Just Another Math Article An Introduction to the Mathematics of Knots and Links BY ROBIN KOYTCHEFF Take a string, such as a loose shoelace, tie it up in some manner and then tape the two ends together
More information1 The fundamental group Topology I
Fundamental group 1 1 The fundamental group Topology I Exercise: Put the picture on the wall using two nails in such a way that removing either of the nails will make the picture fall down to the floor.
More informationarxiv:math/ v1 [math.gt] 2 Nov 1999
A MOVE ON DIAGRAMS THAT GENERATES S-EQUIVALENCE OF KNOTS Swatee Naik and Theodore Stanford arxiv:math/9911005v1 [math.gt] 2 Nov 1999 Abstract: Two knots in three-space are S-equivalent if they are indistinguishable
More informationGenerell Topologi. Richard Williamson. May 28, 2013
Generell Topologi Richard Williamson May 28, 2013 1 20 Thursday 21st March 20.1 Link colourability, continued Examples 20.1. (4) Let us prove that the Whitehead link is not p-colourable for any odd prime
More informationPolynomials in knot theory. Rama Mishra. January 10, 2012
January 10, 2012 Knots in the real world The fact that you can tie your shoelaces in several ways has inspired mathematicians to develop a deep subject known as knot theory. mathematicians treat knots
More informationTutte Polynomials with Applications
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 6 (26), pp. 4781 4797 Research India Publications http://www.ripublication.com/gjpam.htm Tutte Polynomials with Applications
More informationFactoring Families of Positive Knots on Lorenz-like Templates
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 10-2008 Factoring Families of Positive Knots on Lorenz-like Templates Michael C. Sullivan Southern Illinois
More informationHW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).
Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately
More informationA survey of butterfly diagrams for knots and links
University of Northern Iowa UNI ScholarWorks Electronic Theses and Dissertations Graduate College 2017 A survey of butterfly diagrams for knots and links Mark Ronnenberg University of Northern Iowa Copyright
More informationarxiv: v6 [math.gt] 8 May 2017
RECTANGLE CONDITION AND ITS APPLICATIONS BO-HYUN KWON arxiv:404.765v6 [math.gt] 8 May 07 Abstract. In this paper, we define the rectangle condition on the bridge sphere for a n-bridge decomposition of
More informationThe Classification of Nonsimple Algebraic Tangles
The Classification of Nonsimple Algebraic Tangles Ying-Qing Wu 1 A tangle is a pair (B, T ), where B is a 3-ball, T is a pair of properly embedded arcs. When there is no ambiguity we will simply say that
More informationOn the Classification of Rational Knots
arxiv:math/0212011v2 [math.gt] 27 Nov 2003 On the Classification of ational Knots Louis H. Kauffman and Sofia Lambropoulou Abstract In this paper we give combinatorial proofs of the classification of unoriented
More informationFor Ramin. From Jonathan December 9, 2014
For Ramin From Jonathan December 9, 2014 1 Foundations. 1.0 Overview. Traditionally, knot diagrams are employed as a device which converts a topological object into a combinatorial one. One begins with
More informationClassification of Four-Component Rotationally Symmetric Rose Links
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 8 Classification of Four-Component Rotationally Symmetric Rose Links Julia Creager Birmingham-Southern College Nirja Patel Birmingham-Southern
More informationPENGYU LIU, YUANAN DIAO AND GÁBOR HETYEI
THE HOMFLY POLYNOMIAL OF LINKS IN CLOSED BRAID FORM PENGYU LIU, YUANAN DIAO AND GÁBOR HETYEI Abstract. It is well known that any link can be represented by the closure of a braid. The minimum number of
More informationAn Introduction to Mathematical Knots
An Introduction to Mathematical Knots Nick Brettell Postgrad talk, 2011 Nick Brettell (UC) An Introduction to Mathematical Knots Postgrad talk 1 / 18 Outline 1 Introduction to knots Knots and Links History
More informationNON-TRIVIALITY OF GENERALIZED ALTERNATING KNOTS
Journal of Knot Theory and Its Ramifications c World Scientific Publishing Company NON-TRIVIALITY OF GENERALIZED ALTERNATING KNOTS MAKOTO OZAWA Natural Science Faculty, Faculty of Letters, Komazawa University,
More information= A + A 1. = ( A 2 A 2 ) 2 n 2. n = ( A 2 A 2 ) n 1. = ( A 2 A 2 ) n 1. We start with the skein relation for one crossing of the trefoil, which gives:
Solutions to sheet 4 Solution to exercise 1: We have seen in the lecture that the Kauffman bracket is invariant under Reidemeister move 2. In particular, we have chosen the values in the skein relation
More informationp-coloring Classes of Torus Knots
p-coloring Classes of Torus Knots Anna-Lisa Breiland Layla Oesper Laura Taalman Abstract We classify by elementary methods the p-colorability of torus knots, and prove that every p-colorable torus knot
More informationCLASSICAL AND VIRTUAL PSEUDODIAGRAM THEORY AND NEW BOUNDS ON UNKNOTTING NUMBERS AND GENUS
CLASSICAL AND VIRTUAL PSEUDODIAGRAM THEORY AND NEW BOUNDS ON UNKNOTTING NUMBERS AND GENUS A. HENRICH, N. MACNAUGHTON, S. NARAYAN, O. PECHENIK, AND J. TOWNSEND arxiv:0908.1981v [math.gt] 11 Jan 010 Abstract.
More informationTwist Numbers of Links from the Jones Polynomial
Twist Numbers of Links from the Jones Polynomial Mathew Williamson August 26, 2005 Abstract A theorem of Dasbach and Lin s states that the twist number of any alternating knot is the sum of the absolute
More informationVirtual Crossing Number and the Arrow Polynomial
arxiv:0810.3858v3 [math.gt] 24 Feb 2009 Virtual Crossing Number and the Arrow Polynomial H. A. Dye McKendree University hadye@mckendree.edu Louis H. Kauffman University of Illinois at Chicago kauffman@uic.edu
More informationCanonical Forms Some questions to be explored by high school investigators William J. Martin, WPI
MME 529 June 2017 Canonical Forms Some questions to be explored by high school investigators William J. Martin, WPI Here are some exercises based on various ideas of canonical form in mathematics. Perhaps
More informationChapter 3: Groups in science, art, and mathematics
Chapter 3: Groups in science, art, and mathematics Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Spring 2014 M. Macauley (Clemson)
More informationAdvancement to Candidacy. Patterns in the Coefficients of the Colored Jones Polynomial. Katie Walsh Advisor: Justin Roberts
5000 10 000 15 000 3 10 12 2 10 12 1 10 12 Patterns in the Coefficients of the Colored Jones Polynomial 1 10 12 Advisor: Justin Roberts 2 10 12 3 10 12 Introduction Knots and Knot Invariants The Jones
More informationKLEIN LINK MULTIPLICITY AND RECURSION. 1. Introduction
KLEIN LINK MULTIPLICITY AND RECURSION JENNIFER BOWEN, DAVID FREUND, JOHN RAMSAY, AND SARAH SMITH-POLDERMAN Abstract. The (m, n)-klein links are formed by altering the rectangular representation of an (m,
More informationTotal Linking Numbers of Torus Links and Klein Links
Rose- Hulman Undergraduate Mathematics Journal Total Linking Numbers of Torus Links and Klein Links Michael A Bush a Katelyn R French b Joseph R H Smith c Volume, Sponsored by Rose-Hulman Institute of
More informationDeterminants of Rational Knots
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 11:2, 2009, 111 122 Determinants of Rational Knots Louis H. Kauffman 1 and Pedro Lopes 2 1 Department of Mathematics, Statistics and Computer
More informationEE6-16 Equivalent Expressions Pages
EE6-6 Equivalent Expressions Pages 0 STANDARDS 6.EE.A.2, 6.EE.A.3, 6.EE.A. Goals Students will use the area of rectangles and the properties of operations to show that two expressions are equivalent. Vocabulary
More informationFundamentals of Mathematics I
Fundamentals of Mathematics I Kent State Department of Mathematical Sciences Fall 2008 Available at: http://www.math.kent.edu/ebooks/10031/book.pdf August 4, 2008 Contents 1 Arithmetic 2 1.1 Real Numbers......................................................
More informationarxiv:math/ v1 [math.gt] 14 Dec 2004
arxiv:math/0412275v1 [math.gt] 14 Dec 2004 AN OPEN BOOK DECOMPOSITION COMPATIBLE WITH RATIONAL CONTACT SURGERY BURAK OZBAGCI Abstract. We construct an open book decomposition compatible with a contact
More informationGeometric Estimates from spanning surfaces of knots
Geometric Estimates from spanning surfaces of knots joint w/ Stephan Burton (MSU) Michigan State University Knots in Hellas, Olymbia, Greece, July 18, 2016 Burton-Kalfagianni (MSU) J 1 / 20 Knot complement:
More informationQuantum Groups and Link Invariants
Quantum Groups and Link Invariants Jenny August April 22, 2016 1 Introduction These notes are part of a seminar on topological field theories at the University of Edinburgh. In particular, this lecture
More information4 a b 1 1 c 1 d 3 e 2 f g 6 h i j k 7 l m n o 3 p q 5 r 2 s 4 t 3 3 u v 2
Round Solutions Year 25 Academic Year 201 201 1//25. In the hexagonal grid shown, fill in each space with a number. After the grid is completely filled in, the number in each space must be equal to the
More informationarxiv: v1 [math.gt] 11 Aug 2008
Link invariants from finite Coxeter racks Sam Nelson Ryan Wieghard arxiv:0808.1584v1 [math.gt] 11 Aug 2008 Abstract We study Coxeter racks over Z n and the knot and link invariants they define. We exploit
More informationConcordance of certain 3-braids and Gauss diagrams
Concordance of certain 3-braids and Gauss diagrams Michael Brandenbursky Abstract. Let β := σ 1 σ 1 2 be a braid in B 3, where B 3 is the braid group on 3 strings and σ 1, σ 2 are the standard Artin generators.
More informationALTERNATING KNOT DIAGRAMS, EULER CIRCUITS AND THE INTERLACE POLYNOMIAL
ALTERNATING KNOT DIAGRAMS, EULER CIRCUITS AND THE INTERLACE POLYNOMIAL P. N. BALISTER, B. BOLLOBÁS, O. M. RIORDAN AND A. D. SCOTT Abstract. We show that two classical theorems in graph theory and a simple
More information, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
More informationStable periodic billiard paths in obtuse isosceles triangles
Stable periodic billiard paths in obtuse isosceles triangles W. Patrick Hooper March 27, 2006 Can you place a small billiard ball on a frictionless triangular pool table and hit it so that it comes back
More informationKnot Floer Homology and the Genera of Torus Knots
Knot Floer Homology and the Genera of Torus Knots Edward Trefts April, 2008 Introduction The goal of this paper is to provide a new computation of the genus of a torus knot. This paper will use a recent
More informationA picture of some torus knots and links. The first several (n,2) links have dots in their center. [1]
Torus Links and the Bracket Polynomial By Paul Corbitt Pcorbitt2@washcoll.edu Advisor: Dr. Michael McLendon Mmclendon2@washcoll.edu April 2004 Washington College Department of Mathematics and Computer
More informationSolutions Parabola Volume 49, Issue 2 (2013)
Parabola Volume 49, Issue (013) Solutions 1411 140 Q1411 How many three digit numbers are there which do not contain any digit more than once? What do you get if you add them all up? SOLUTION There are
More informationScharlemann s manifold is standard
Annals of Mathematics, 149 (1999), 497 510 Scharlemann s manifold is standard By Selman Akbulut* Dedicated to Robion Kirby on the occasion of his 60 th birthday Abstract In his 1974 thesis, Martin Scharlemann
More informationON THE DEGREE OF THE BRANDT-LICKORISH-MILLETT-HO POLYNOMIAL OF A LINK
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 100, Number 4. August 1987 ON THE DEGREE OF THE BRANDT-LICKORISH-MILLETT-HO POLYNOMIAL OF A LINK MARK E. KIDWELL ABSTRACT. Let Ql be the link polynomial
More informationCampus Academic Resource Program The Pythagorean Theorem
This handout will: Examine the properties of length and area for the square. Provide a visual interpretation of the Pythagorean Theorem Apply the Pythagorean Theorem in various contexts In 570 BC, on the
More informationarxiv: v2 [math.gt] 26 Aug 2017
ARROW CALCULUS FOR WELDED AND CLASSICAL LINKS JEAN-BAPTISTE MEILHAN AND AKIRA YASUHARA arxiv:1703.04658v2 [math.gt] 26 Aug 2017 Abstract. We develop a calculus for diagrams of knotted objects. We define
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2014 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationPREFACE. Synergy for Success in Mathematics 7 is designed for Grade 7 students. The textbook
Synergy for Success in Mathematics 7 is designed for Grade 7 students. The textbook contains all the required learning competencies and is supplemented with some additional topics for enrichment. Lessons
More informationarxiv: v1 [math.gt] 27 Sep 2018
NP HARD PROBLEMS NATURALLY ARISING IN KNOT THEORY arxiv:1809.10334v1 [math.gt] 27 Sep 2018 DALE KOENIG AND ANASTASIIA TSVIETKOVA Abstract. We prove that certain problems naturally arising in knot theory
More informationGranite School District Parent Guides Utah Core State Standards for Mathematics Grades K-6
Granite School District Parent Guides Grades K-6 GSD Parents Guide for Kindergarten The addresses Standards for Mathematical Practice and Standards for Mathematical Content. The standards stress not only
More information2.1 Identifying Patterns
I. Foundations for Functions 2.1 Identifying Patterns: Leaders' Notes 2.1 Identifying Patterns Overview: Objective: s: Materials: Participants represent linear relationships among quantities using concrete
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationarxiv: v2 [math.gt] 4 Sep 2017
ON REALIZABILITY OF GAUSS DIAGRAMS Andrey Grinblat and Viktor Lopatkin arxiv:.v [math.gt] Sep Abstract. The problem of which Gauss diagram can be realized by knots is an old one and has been solved in
More informationLEGENDRIAN AND TRANSVERSE TWIST KNOTS
LEGENDRIAN AND TRANSVERSE TWIST KNOTS JOHN B. ETNYRE, LENHARD L. NG, AND VERA VÉRTESI Abstract. In 1997, Chekanov gave the first example of a Legendrian nonsimple knot type: the m(5 2) knot. Epstein, Fuchs,
More informationMath 016 Lessons Wimayra LUY
Math 016 Lessons Wimayra LUY wluy@ccp.edu MATH 016 Lessons LESSON 1 Natural Numbers The set of natural numbers is given by N = {0, 1, 2, 3, 4...}. Natural numbers are used for two main reasons: 1. counting,
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More informationRATIONAL TANGLES AND THE MODULAR GROUP
MOSCOW MATHEMATICAL JOURNAL Volume, Number, April June 0, Pages 9 6 RATIONAL TANGLES AND THE MODULAR GROUP FRANCESCA AICARDI Dedicated to V.I. Arnold, with endless gratitude Abstract. There is a natural
More informationLecture 4: Knot Complements
Lecture 4: Knot Complements Notes by Zach Haney January 26, 2016 1 Introduction Here we discuss properties of the knot complement, S 3 \ K, for a knot K. Definition 1.1. A tubular neighborhood V k S 3
More informationA marks are for accuracy and are not given unless the relevant M mark has been given (M0 A1 is impossible!).
NOTES 1) In the marking scheme there are three types of marks: M marks are for method A marks are for accuracy and are not given unless the relevant M mark has been given (M0 is impossible!). B marks are
More informationPRIMES Math Problem Set
PRIMES Math Problem Set PRIMES 017 Due December 1, 01 Dear PRIMES applicant: This is the PRIMES 017 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 01.
More informationOn boundary primitive manifolds and a theorem of Casson Gordon
Topology and its Applications 125 (2002) 571 579 www.elsevier.com/locate/topol On boundary primitive manifolds and a theorem of Casson Gordon Yoav Moriah 1 Department of Mathematics, Technion, Haifa 32000,
More informationIntroduction Knot Theory Nonlinear Dynamics Topology in Chaos Open Questions Summary. Topology in Chaos
Introduction Knot Theory Nonlinear Dynamics Open Questions Summary A tangled tale about knot, link, template, and strange attractor Centre for Chaos & Complex Networks City University of Hong Kong Email:
More informationDistance and intersection number in the curve graph of a surface
Distance and intersection number in the curve graph of a surface Joan Birman, Matthew J. Morse, and Nancy C. Wrinkle arxiv:0.07v [math.gt] Sep 0 September, 0 Abstract We highlight a new relationship between
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More informationA computer search for ribbon alternating knots
A computer search for ribbon alternating knots (joint work with Frank Swenton) Brendan Owens University of Glasgow Warwick, 12th December 2017 Knots A knot in S 3 is a smooth simple closed curve (up to
More informationCOMPOSITE KNOTS IN THE FIGURE-8 KNOT COM PLEMENT CAN HAVE ANY NUMBER OF PRIME FAC TORS
COMPOSITE KNOTS IN THE FIGURE-8 KNOT COM PLEMENT CAN HAVE ANY NUMBER OF PRIME FAC TORS Michael C. SULLIVAN Department of Mathematics, University of Texas, Austin, TX 78712, U8A, mike@mat.h,ut.exas,edu
More informationThe Pigeonhole Principle
The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,
More informationFundamentally Different m-colorings of Pretzel Knots
Journal of Knot Theory and Its Ramifications c World Scientific Publishing Company Fundamentally Different m-colorings of Pretzel Knots KATHRYN BROWNELL Lenoir-Rhyne College, Department of Mathematics,
More information1. What Is Knot Theory? Why Is It In Mathematics?
1. What Is Knot Theory? Why Is It In Mathematics? In this chapter, we briefly explain some elementary foundations of knot theory. In 1.1, we explain about knots, links and spatial graphs together with
More informationTROPICAL BRILL-NOETHER THEORY
TROPICAL BRILL-NOETHER THEORY 5. Special divisors on a chain of loops For this lecture, we will study special divisors a generic chain of loops. specifically, when g, r, d are nonnegative numbers satisfying
More information2.4 Investigating Symmetry
Locker LESSON 2.4 Investigating Symmetry Texas Math Standards The student is expected to: G.3.D Identify and distinguish between reflectional and rotational symmetry in a plane figure. Mathematical Processes
More informationRelationships between Braid Length and the Number of Braid Strands
The University of San Francisco USF Scholarship: a digital repository @ Gleeson Library Geschke Center Mathematics College of Arts and Sciences 2007 Relationships between Braid Length and the Number of
More informationAlgebra Revision Guide
Algebra Revision Guide Stage 4 S J Cooper 1st Edition Collection of like terms... Solving simple equations... Factorisation... 6 Inequalities... 7 Graphs... 9 1. The straight line... 9. The quadratic curve...
More informationGrade 9 Mathematics Unit #2 Patterns & Relations Sub-Unit #1 Polynomials
Grade 9 Mathematics Unit #2 Patterns & Relations Sub-Unit #1 Polynomials Lesson Topic I Can 1 Definitions Define Polynomials Identify Polynomials Identify different parts of a polynomial Identify monomials,
More informationKindergarten Grade 1 Grade 2
Kindergarten Grade 1 Grade 2 NK.1 Say the whole number sequence by 1s starting anywhere from 0 to 10 and from 10 to 0. N1.1 Say the number sequence, 0 to 100, by: 1s forward and backward between any two
More information2. Force Systems. 2.1 Introduction. 2.2 Force
2. Force Systems 2.1 Introduction 2.2 Force - A force is an action of one body on another. - A force is an action which tends to cause acceleration of a body (in dynamics). - A force is a vector quantity.
More informationJohns Hopkins Math Tournament Proof Round: Automata
Johns Hopkins Math Tournament 2018 Proof Round: Automata February 9, 2019 Problem Points Score 1 10 2 5 3 10 4 20 5 20 6 15 7 20 Total 100 Instructions The exam is worth 100 points; each part s point value
More informationCLASS-IX MATHEMATICS. For. Pre-Foundation Course CAREER POINT
CLASS-IX MATHEMATICS For Pre-Foundation Course CAREER POINT CONTENTS S. No. CHAPTERS PAGE NO. 0. Number System... 0 3 0. Polynomials... 39 53 03. Co-ordinate Geometry... 54 04. Introduction to Euclid's
More informationKnots, Coloring and Applications
Knots, Coloring and Applications Ben Webster University of Virginia March 10, 2015 Ben Webster (UVA) Knots, Coloring and Applications March 10, 2015 1 / 14 This talk is online at http://people.virginia.edu/~btw4e/knots.pdf
More informationTunnel Numbers of Knots
Tunnel Numbers of Knots by Kanji Morimoto Department of IS and Mathematics, Konan University Okamoto 8-9-1, Higashi-Nada, Kobe 658-8501, Japan morimoto@konan-u.ac.jp Abstract Tunnel number of a knot is
More informationarxiv: v1 [math.co] 19 Aug 2016
THE EXCHANGE GRAPHS OF WEAKLY SEPARATED COLLECTIONS MEENA JAGADEESAN arxiv:1608.05723v1 [math.co] 19 Aug 2016 Abstract. Weakly separated collections arise in the cluster algebra derived from the Plücker
More information