The Kauffman Bracket as an Evaluation of the Tutte Polynomial Whitney Sherman Saint Michael’s College.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Based on slides by Y. Peng University of Maryland
Voronoi Diagram – Fortune ’ s Algorithm Reporter: GI1 11 號 蔡逸凡 Date: 2004/10/28 Reference: Computational Geometry ch7 ISBN:
KRISTEN MCGAHAN Knot Groups. Group: A closed algebraic structure that has a law of composition with three properties Associative- (ab)c=a(bc) for all.
Hydrocarbon Chains: Stuck Unknots?
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.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 3 By Herb I. Gross and Richard A. Medeiros next.
Progressively Finite Games
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 4.3 Graph Models Prepared by Jo Ellis-Monaghan.
The Circuit Partition Polynomial and Relation to the Tutte Polynomial Prof. Ellis-Monaghan 1 Andrea Austin The project described was.
1 Section 8.2 Graph Terminology. 2 Terms related to undirected graphs Adjacent: 2 vertices u & v in an undirected graph G are adjacent (neighbors) in.
Whitney Sherman & Patti Bodkin Saint Michael’s College.
Reduction Techniques Restriction Local Replacement Component Design Examples.
Tucker, Applied Combinatorics, Section 1.4, prepared by Patti Bodkin
Approximation Algorithms
10/27/051 From Potts to Tutte and back again... A graph theoretical view of statistical mechanics Jo Ellis-Monaghan
The Circuit Partition Polynomial and Relation to the Tutte Polynomial Prof. Ellis-Monaghan 1 Andrea Austin The project described was.
1 Patti Bodkin Saint Michael’s College Colchester, VT
Algebraic Topology - Homotopy Groups of Spheres Martin Leslie, University of Queensland.
College Algebra Fifth Edition
Adding and Subtracting Integers.
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.
Table of Contents The independent variable, x, denotes a member of the domain and the dependent variable, y, denotes a member of the range. We say, "y.
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.
Maps. Graphs on Surfaces We are mainly interested in embeddings of graphs on surfaces:  : G ! S. An embedding should be differentiated from immersion.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
Lecture 03: Theory of Automata:08 Finite Automata.
Trigonometric Equations M 140 Precalculus V. J. Motto.
The Tutte Polynomial Graph Polynomials winter 05/06.
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
Compound Inequalities “And” & “Or” Graphing Solutions.
Mr Barton’s Maths Notes Graphs 2. Quadratics and Cubics
REVIEW A relation is a set of ordered pairs. {(2,3), (-1,5), (4,-2), (9,9), (0,-6)} This is a relation The domain is the set of all x values.
This presentation was found at We made some minor formatting changes on slides because of overlapping material, and added this slide.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Drill #4 Evaluate the following if a = -2 and b = ½. 1. ab – | a – b | Solve the following absolute value equalities: 2. |2x – 3| = |5 – x | + 4.
Lots About Knots With a View Towards the Jones Polynomial Anne-Marie Oreskovich Math 495-B, Spring 2000.
The Miracle of Knot 1.Knot Theory 2.Tricolorability.
> 0 is always POSITIVE< 0 is always NEGATIVE The sign on the leading coefficient is the sign of the RHB. Once the regions are labeled, shaded the desired.
Great Theoretical Ideas in Computer Science for Some.
Inequalities.
Chapter 3 Polynomial and Rational Functions Copyright © 2014, 2010, 2007 Pearson Education, Inc Polynomial and Rational Inequalities.
Two-step Inequalities SOL 8.15 cont.. What is an inequality? An inequality is a mathematical sentence that compares expressions using: < less than > greater.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits.
COMPSCI 102 Introduction to Discrete Mathematics.
Senior Project Board Implementation of the Solution to the Conjugacy Problem in Thompson’s Group F by Nabil Hossain Advisers: James Belk & Robert McGrail.
Lecture 12 Algorithm Analysis Arne Kutzner Hanyang University / Seoul Korea.
A Computational Approach to Knotting in Complete Graphs Dana Rowland and David Toth Merrimack College, North Andover, MA Abstract We are interested in.
Mathematical problems in knot theory
5.9.2 Characterizations of Planar Graphs
MTH 392A Topics in Knot theory
Introduction to Graph Theory
Lecture 12 Algorithm Analysis
Compound Inequalities
Based on slides by Y. Peng University of Maryland
Characteristics of knots
Magic Loops You will need: A long length of string
Lecture 12 Algorithm Analysis
Spin Models and Distance-Regular Graphs
1.5: Limits We will learn about: limits, finding limits,
Bipartite graphs and Planar Graphs
Section 14.1 Graphs, Paths, and Circuits
Gaph Theory Planar Graphs
Lecture 12 Algorithm Analysis
Graphs, Paths, and Circuits
> 0 is always POSITIVE
Presentation transcript:

The Kauffman Bracket as an Evaluation of the Tutte Polynomial Whitney Sherman Saint Michael’s College

2 What is a knot? A piece of string with a knot tied in it Glue the ends together

3 Movement If you deform the knot it doesn’t change.

4 The Unknot The simplest knot. An unknotted circle, or the trivial knot. You can move from the one view of a knot to another view using Reidemeister moves.

5 Reidemeister Moves First: Allows us to put in/take out a twist. Second: Allows us to either add two crossings or remove two crossings. Third: Allows us to slide a strand of the knot from one side of a crossing to the other.

6 Links A set of knots, all tangled. The classic Hopf Links with two components and 10 components. The Borremean Rings with three components.

7 Labeling Technique Begin with the shaded knot projection. If the top strand ‘spins’ left to sweep out black then it’s a + crossing. If the top strand ‘spins’ right then it’s a – crossing. -+

8 Links to Planar Graphs

9 Kauffman Bracket in Terms of Pictures Three Rules –1. –2. a b –3.

10 The Connection Find the Kauffman Bracket values of and in the Tutte polynomial. =A + A =A(-A -A ) + A (1) = -A -223 =A + A =A(1) + A (-A –A ) = -A

11 Kauffman Bracket In Polynomial Terms if is an edge corresponding to: negative crossing: –There exists a graph such that where and denote deletion and contraction of the edge from positive crossing: –There exists a graph G such that

12 Recall Universality Property Some function on graphs such that and (where is either the disjoint union of and or where and share at most one vertex) is given by value takes on bridges value takes on loops Tutte polynomial The Universality of the Tutte Polynomial says that any invariant which satisfies those two properties is an evaluation of the Tutte polynomial If is an alternating positive link diagram then the Bracket polynomial of the unsigned graph is

13 The Connection Cont We know from the Kauffman Bracket that, and from that By replacing with, with, and with … we get one polynomial from the other. With those replacements the function becomes

14 The Connection Cont Recall: Rank by definition is the vertex set minus the number of components of the graph (which in our case is 1) With those replacements =

15 Final Touches With the values and Showing that the Kauffman bracket is an invariant of the Tutte polynomial.

16 Applications of the Kauffman Bracket It is hard to tell unknot from a messy projection of it, or for that matter, any knot from a messy projection of it. If does not equal, then can’t be the same knot as. However, the converse is not necessarily true.

17 Resources Pictures taken from – /scharein/KnotPlot.html Other information from –The Knot Book, Colin Adams –Complexity: Knots, Colourings and Counting, D. J. A. Welsh –Jo Ellis-Monaghan