Knot Theory By Aaron Wagner Several complex variables and analytic spaces for infinite-dimensional holomorphy -Knot Theory.

Slides:



Advertisements
Similar presentations
Finding Gold In The Forest …A Connection Between Fractal Trees, Topology, and The Golden Ratio.
Advertisements

Knot Theory Senior Seminar by Tim Wylie December 3, 2002.
The Unifying View on Ordinary Differential Equations and Automatic Differentiation, yet with a Gap to Fill Alexander Gofen What was unified? Conventions.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross By Herbert I. Gross and Richard A. Medeiros next Set 9.
5.1 Real Vector Spaces.
Knots have been studied extensively by mathematicians for the last hundred years. One of the most peculiar things which emerges as you study knots is.
Comparative Succinctness of KR Formalisms Paolo Liberatore.
Experiments and Variables
Chapter 1 Section 3 Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
The Kauffman Bracket as an Evaluation of the Tutte Polynomial Whitney Sherman Saint Michael’s College.
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.
What do these knots have in common? Hint: Numbers can be categorized as this, also.
Key Stone Problem… Key Stone Problem… next Set 21 © 2007 Herbert I. Gross.
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
Ty Callahan.  Lord Kelvin thought that atoms could be knots  Mathematicians create table of knots  Organization sparks knot theory.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
Simplicial Sets, and Their Application to Computing Homology Patrick Perry November 27, 2002.
5.II. Similarity 5.II.1. Definition and Examples
Lower Bounds for the Ropelength of Reduced Knot Diagrams by: Robert McGuigan.
Chapter 11: Limitations of Algorithmic Power
Colored Necklace Bisection Victor Kostyuk Advisor: Michael Capalbo.
Toward NP-Completeness: Introduction Almost all the algorithms we studies so far were bounded by some polynomial in the size of the input, so we call them.
Algebraic Topology - Homotopy Groups of Spheres Martin Leslie, University of Queensland.
CS 255: Database System Principles slides: Variable length data and record By:- Arunesh Joshi( 107) Id: Cs257_107_ch13_13.7.
Algebra: Variables and Expressions variable A variable is a letter or symbol that represents an unknown quantity (a number). ALGEBRA. The branch of mathematics.
The warping degree and the unknotting number of a spatial graph Akio Kawauchi Osaka City University at East Asian School at Gyeongju January 15, 2009.
Expressions, Identities, Formulae, Equations The following slides show examples of many common and sometimes important expressions, identities, formulae.
Introduction Two equations that are solved together are called systems of equations. The solution to a system of equations is the point or points that.
Math Dept, Faculty of Applied Science, HCM University of Technology
Mrs. Martinez CHS MATH DEPT.
Linear Equations in Linear Algebra
1 The subtle relationship between Physics and Mathematics.
System of Linear Equations Nattee Niparnan. LINEAR EQUATIONS.
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.
Chapter 7: Polynomials This chapter starts on page 320, with a list of key words and concepts.
Table of Contents Solving Linear Systems of Equations - Dependent Systems The goal in solving a linear system of equations is to find the values of the.
Blown Away: What Knot to Do When Sailing Sir Randolph Bacon III.
Properties of Real Numbers. Sets In mathematics, a set is a collection of things Sets can be studies as a topic all on its own (known as set theory),
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Chapter 1 Section 3. Objectives 1 Copyright © 2012, 2008, 2004 Pearson Education, Inc. Evaluate algebraic expressions, given values for the variables.
Solving by Substitution Method or Elimination (Addition) Method
2 Chapter 21 Understanding Structure Programming Logic and Design, Second Edition, Comprehensive 2.
Lots About Knots With a View Towards the Jones Polynomial Anne-Marie Oreskovich Math 495-B, Spring 2000.
On generalization of Khovanov link homologies
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.
Programming Logic and Design Fifth Edition, Comprehensive
8.2 Multiplication and Division of Rational Expressions.
Definition Characteristics Examples Non-examples integer Definition Characteristics Examples Non-examples The set of ______ numbers and their ___________.
Chapter 7: Polynomials This chapter starts on page 320, with a list of key words and concepts.
COMPLEXITY. Satisfiability(SAT) problem Conjunctive normal form(CNF): Let S be a Boolean expression in CNF. That is, S is the product(and) of several.
Theory of Computation Automata Theory Dr. Ayman Srour.
A Computational Approach to Knotting in Complete Graphs Dana Rowland and David Toth Merrimack College, North Andover, MA Abstract We are interested in.
10.2 The Substitution Method
Algebraic Expressions (Part 2)
Mathematical problems in knot theory
MTH 392A Topics in Knot theory
Chapter 1 Systems of Linear Equations and Matrices
Characteristics of knots
CSCE 411 Design and Analysis of Algorithms
A Survey of Knots and Links
9 Ropes and Knots.
Spin Models and Distance-Regular Graphs
Algebra: Variables and Expressions
Chapter 1 Section 3.
Patterns and Inductive Reasoning
CS 150: Computing - From Ada to the Web
Computational Analysis of DNA Gyrase Action
Presentation transcript:

Knot Theory By Aaron Wagner Several complex variables and analytic spaces for infinite-dimensional holomorphy -Knot Theory

What is a Knot Imagine a rope with the two ends attached together so there is no possible way for the knot to be untied. So a knot is a one-dimensional line segment wrapping it around itself arbitrarily, and then fusing the two free ends together.

Reidemeister moves In 1926, Kurt Reidemeister proved that two knot diagrams belonging to the same knot can be related by a sequence of three Reidemeister moves.

Reidemeister moves There are three Reidemeister moves. Each one takes part of the knot and makes a change to it.

Tricolorable A knot is tricolorable if each strand of the knot diagram can be colored in one of three colors, subject to the following rules: At least two colors must be used, and At each crossing, the three incident strands are either all the same color or all different colors.

The unknot The Unknot is a knot that is a closed loop of string without a knot in it. This is called the trivial knot. It is a knot that will start out as the trivial knot, be deformed, then changed back to the trivial knot.

The Unknot

So one current problem in knot theory is to find an efficient way to figure out if any knot is equivalent to the trivial knot. There are currently many ways to do this, but there is no way that works one hundred percent of the time.

Methods So Far There are multiple methods that can currently be used to tell if a knot is the unknot. One way is to see if the Reidemeister moves will create the unknot.

Tricolorable If a diagram is tricolorable then it is potentially non- trivial. However there is a lot of non-trivial knots that are not 3-colorable.

Other work The Alexander polynomials distinguishes most small knots from the unknot. But this does not work for larger knots.

Other work In 1985 the Jones polynomial was created that distinguishes more knots. It is currently unknown if it always can detect the unknot. This method produces a polynomial from any knot. This method will also always give the same polynomial for a particular knot, even if the knot looks very different. Unfortunately it can also give identical polynomials for knots that are completely different.

Other Knots Khovanov homology was created in In 2010 Kronheimer-Mrowka stated that it will always detect the unknot, but that is still unknown to be true. What this does is it distinguishes between any two knots that the Jones polynomial could tell apart, and some that the polynomial couldn’t. They did this using techniques from Algebra.

Other work Combinatorial knot Floer homology was developed in It is also unknown if it always detects the unknot. To figure this out they used symplectic geometry, a branch of geometry relating to physics. This is used to determine whether a loop is knotted at all. It can also sometimes distinguish the unknot from any non-trivial knot.

Infinitely many knots can be made, so there will always be the question of given a knot, is it the unknot?

Sources theory theory