Knot Theory Senior Seminar by Tim Wylie December 3, 2002.

Slides:



Advertisements
Similar presentations
Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.
Advertisements

Introduction to digital topology
Great Theoretical Ideas in Computer Science
5.1 Real Vector Spaces.
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Map-making as Graph Drawing Alan Saalfeld Mathematical Cartographer.
Edge-connectivity and super edge-connectivity of P 2 -path graphs Camino Balbuena, Daniela Ferrero Discrete Mathematics 269 (2003) 13 – 20.
Copyright © Cengage Learning. All rights reserved.
Knot Theory By Aaron Wagner Several complex variables and analytic spaces for infinite-dimensional holomorphy -Knot Theory.
To show that the Kauffman Bracket is unchanged under each of the three Reidemeister moves. First explain the basics of knot theory. Then show you what.
The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008.
An Untangled Introduction to Knot Theory Ana Nora Evans University of Virginia Mathematics 12 February 2010.
CompSci 102 Discrete Math for Computer Science April 19, 2012 Prof. Rodger Lecture adapted from Bruce Maggs/Lecture developed at Carnegie Mellon, primarily.
What do these knots have in common? Hint: Numbers can be categorized as this, also.
Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
Train DEPOT PROBLEM USING PERMUTATION GRAPHS
Ty Callahan.  Lord Kelvin thought that atoms could be knots  Mathematicians create table of knots  Organization sparks knot theory.
M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Based on the paper by M. Farber and D. Schütz Presented by Yair.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 I THE NATURAL PSEUDODISTANCE:
Lower Bounds for the Ropelength of Reduced Knot Diagrams by: Robert McGuigan.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Field Theory: The Past 25 Years Nathan Seiberg (IAS) The Future of Physics October, 2004 A celebration of 25 Years of.
Graphs, relations and matrices
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Chapter 3 Greek Number Theory The Role of Number Theory Polygonal, Prime and Perfect Numbers The Euclidean Algorithm Pell’s Equation The Chord and Tangent.
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
Visual data analysis a chance and a challenge for mathematicians Krzysztof S. Nowiński (ICM)
Systems of Linear Equation and Matrices
Matrix Representations of Knot and Link Groups Jess May 2006 Knot Theory Knot Theory is the study of mathematical knots. A knot is a simple closed polygonal.
Binomial Expansions-Math Reflection
1 Part II: Linear Algebra Chapter 8 Systems of Linear Algebraic Equations; Gauss Elimination 8.1 Introduction There are many applications in science and.
V. Space Curves Types of curves Explicit Implicit Parametric.
Chapter 3 – Set Theory  .
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
The Relativistic Quantum Field Calculator for Elementary Particle Interactions Brandon Green, Dr. Edward Deveney (Mentor) Department of Physics, Bridgewater.
17. Group Theory 1.Introduction to Group Theory 2.Representation of Groups 3.Symmetry & Physics 4.Discrete Groups 5.Direct Products 6.Symmetric Groups.
Section 2.3 Properties of Solution Sets
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Planar Graphs Graph Coloring
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Graphs Basic properties.
The Miracle of Knot 1.Knot Theory 2.Tricolorability.
Basic probability Sep. 16, Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies.
Combinatorics Ramsey theory.  a precocious British mathematician, philosopher and economist  a problem in mathematical logic: can one always find order.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
Great Theoretical Ideas in Computer Science for Some.
COMPSCI 102 Introduction to Discrete Mathematics.
2 2.2 © 2016 Pearson Education, Ltd. Matrix Algebra THE INVERSE OF A MATRIX.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
What is Topology? Sabino High School Math Club Geillan Aly University of Arizona March 6, 2009.
A Computational Approach to Knotting in Complete Graphs Dana Rowland and David Toth Merrimack College, North Andover, MA Abstract We are interested in.
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop.
Chapter 2 Sets and Functions.
Knot theory seminar.
Chapter 9 (Part 2): Graphs
Postulates of Quantum Mechanics
Great Theoretical Ideas In Computer Science
Mathematical problems in knot theory
MTH 392A Topics in Knot theory
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Graphs Chapter 13.
Spin Models and Distance-Regular Graphs
Discrete Mathematics for Computer Science
Presentation transcript:

Knot Theory Senior Seminar by Tim Wylie December 3, 2002

Outline Introduction with brief history Lord Kelvins atom Defining a knot History and Progress Individual advances in the field Applications Conclusion

In 1867 Lord Kelvin proposed his theory of the vortex atom. He was inspired by a paper by Helmholtz on vortices, and by a paper by Riemann on Abelian functions. His theory stated that atoms are vortex rings, the movement of the vortex giving the illusion of matter. It also stated that chemical properties of elements were related to knotting that occurs between atoms.

Peter G. Tait In 1877 published the first paper addressing the enumeration of knots. Over the next few years he began working with C.N. Little and together they completed all the enumerations of knots past 10 crossings by Problems When his work began, the formal mathematics needed to address the subject was unavailable. He found the distinct knots but didnt have the math needed to prove they were distinct.

However, work at the beginning of the 20 th century placed the subject of topology on firm mathematical ground. Now it was possible to precisely define knots and to prove theorems about them. Algebraic methods introduced into the subject became especially important, providing the means to prove distinct knots. Topology The Tait conjectures-conjectures about knot projections that were unable to be proven at the time.

So, what is a knot? A simple definition is that a knot is a continuous simple closed curve in three-dimensional Euclidean space R3 This however, is not an entirely accurate definition because it is extremely difficult to deal with deformations, and it allows some infinite wild knots that are improbable. So, we define a knot as a simple closed polygonal curve in R3. For any two distinct points in 3-space, p and q, let [p,q] denote the line segment joining them. For an ordered set of distinct points (p1, p2,……, pn), the union of the segments [p1, p2], [p2,p3],…. [pn-1, pn] and [pn,p1] is called a closed polygonal curve. If each segment intersects exactly two other segments, intersecting each only at an endpoint, then the curve is said to be simple.

Right, so now some pictures. Knots are stick knots but are usually drawn and thought of as smooth. Intuitively, we realize that a smooth knot would be closely approximated with a very large number of segments in a polygonal curve.

This observation leads us to a useful definition of minimizing the points in a knot. If the ordered set (p1, p2, ….,pn) defines a knot, and no proper ordered subset defines the same knot, the elements of the set {pi} are called vertices of the knot. The two simplest knots are the right and left trefoil, which are each distinct.

In 1914 Max Dehn was the first to prove that two knots were distinct. He proved the right and left trefoils were distinct. Two knots are viewed as equivalent, or of the same type, if one can be deformed into the other knot. So to understand equivalence you have to understand deformations. Definition: A knot J is called an elementary deformation of the knot K if one of the two knots is determined by a sequence of points (p1, p2,…,pn) and the other is determined by the sequence (p0, p1, p2,…,pn), where 1.p0 is a point which is not collinear with p1 and pn, and 2.The triangle spanned by (p0, p1, pn) intersects the knot determined by (p1, p2,….,pn) only in the segment [p1, pn].

Definition: Knots K and J are called equivalent if there is a sequence of knots K=K0, K1,…,Kn=J with each K(i+1) an elementary deformation of Ki, for i greater than 0. Combinatorial Methods The techniques of knot theory based on the study of knot diagrams. 1. The Reidemeister Moves 2.Knot Colorings 3.The Alexander polynomial A knot diagram is the projection (or shadow) of a knot from 3-space to a plane. It can be proven that if two knots have the same projection they are equivalent regardless of their dimensions in R3.

The Reidemeister Moves In 1932 K. Reidemeister invented the Reidemeister moves. Theorem: If two knots are equivalent, their diagrams are related by a sequence of Reidemeister moves. In theory these tools are enough to distinguish any pair of distinct knots, however, for knots with complicated diagrams the calculations are often too lengthy to be of use.

Knot Colorings The method of distinguishing knots using the colorability of their diagrams was invented by Ralph Fox. A knot is called colorable if each arc can be drawn using one of three colors in such a way that: 1.At least two of the colors are used 2.At any crossing at which two colors appear, all three appear. Theorem: If a diagram of a knot, K, is colorable, then every diagram of K is colorable.

The Alexander Polynomial In 1928 James Alexander described a method of associating to each knot a polynomial such that if one knot can be deformed into another, both will have the same associated polynomial. Invariant: A quantity which remains unchanged under certain classes of transformations. Invariants are extremely useful for classifying mathematical objects because they usually reflect intrinsic properties of the object of study. Calculating the Alexander Polynomial……. 1.Pick a diagram of the knot K 2.Number the arcs of the diagram 3.Separately, number the crossings 4.Define an N x N matrix where N is the number of crossings (and arcs)

5.Take a crossing numbered L. If it is right-handed with arc i passing over arcs j and k enter a (1-t) in column i of row L, enter a (-1) in column j of that row, and enter a (t) in column k of that row. If the crossing is left-handed, enter a (1-t) in column i of row L, enter a (t) in column j and enter a (-1) in column k of row L. All other entries in row L are 0. 6.Remove the last column and row of the N x N matrix. 7.Take the determinant of the (N-1) x (N-1) matrix AND WERE DONE!!!

The most simple knot to determine the alexander polynomial of is the trefoil. Applying the first several steps we end up with this matrix. (1-t)t-1 -1(1-t)t -1t (1-t) Deleting the bottom row and the last column gives a 2x2 matrix. Taking the determinant gives the Alexander polynomial A(t)=t^2 –t +1 Theorem: If the Alexander polynomial for a knot is computed using two different sets of choices for diagrams and labelings, the two polynomials will differ by a multiple of +-t^k for some integer k.

More History In the mid 1930s H. Seifert demonstrated that if a knot is the boundary of a surface in 3-space, then that surface can be used to study the knot. This discovery laid the foundation for the use of geometric methods in knot theory. In 1947 H. Schubert used geometric methods to prove that there are prime knots. A knot is called prime if it cannot be decomposed as a connected sum of nontrivial knots. Any knot can be decomposed uniquely as the connected sum of prime knots.

F. Waldhausen proved in 1968 that two knots are equivalent if and only if certain algebraic properties are the same. In 1957 C. Papakyriakopoulos succeeded in proving the Dehn Lemma, which says that if a knot were indistinguishable from the trivial knot using algebraic methods, then the knot is in fact trivial. William Thurston proved in 1978 that the complements of knots in 3-space have a complete hyberbolic structures. The Tait conjectures were finally proven in the late 80s based on a completely different polynomial invariant using the theory of operator algebras. The invariant was discovered in 1987 by Vaughan Jones.

Applications The first place knot theory was seriously used was in the study and manipulation of DNA. It was discovered in 1953 by Watson and Crick. They also discovered that DNA can become knotted which makes it difficult to carry out its function. Knot theory is also used in molecular chemistry and statistical mechanics. A recent use of knot theory is applying it to quantum computing.

The biggest contributions of knot theory have just recently developed thanks To the work of Vaughan Jones and his invariants. 1)all 3-manifolds can be describe in terms of knots and links via an operation called Dehn surgery; 2) there exists a set of moves, the Kirby calculus, that allow one to move between differing Dehn surgery descriptions of the same homeomorphic 3-manifold. Edward Witten has discovered that knots are connected to quantum field theory through generalized 3-manifold invariants.

Distinct knots = ?

Acknowledgements God My Family My Wife, Rachel My Teachers My Friends

Sources Livingston, Charles. Knot theory. Washington, DC: Mathematical Association of America, Johnson, Scholz, et al. History of Topology. Amsterdam: Elsevier Science B.V., Crowell, Richard H., and Ralph H. Fox. Introduction to Knot Theory. New York, NY. Blaisdell Publishing Company, 1963 A Circular History of Knot Theory The Knotplot site Knot Theory: An Introduction Knot Theory Knot Theory Online

Q uestions ?