061350/Homework Assignment 1
From Drorbn
Jump to navigationJump to search

Solve the following problems and submit them in class by October 19, 2006:
 Let be an odd prime. A knot diagram is called colourable if there is a nonconstant map ("colouring") from the arcs of to so that at every crossing, the average of the colours of the two "under" arcs is equal to the colour of the "over" arc (calculations in , of course).
 Show that the newlydefined meaning of 3colourable coincides with the definition given for this notion in class.
 Show that "being colourable" is invariant under Reidemeister moves and hence defines a knot invariant.
 (Hard and not mandatory) Prove that the (5,3) torus knot T(5,3) (pictured above) is not colourable for any .
 Use the recursion formula Failed to parse (unknown function "\overcrossing"): {\displaystyle q^{1}J(\overcrossing)qJ(\undercrossing)=(q^{1/2}  q^{1/2})J(\smoothing)} and the initial condition to compute the Jones polynomial Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle J(\HopfLink)} of the Hopf link and the Jones polynomial Failed to parse (unknown function "\righttrefoil"): {\displaystyle J(\righttrefoil)} of the right handed trefoil knot.
 Explain in detail why is the set {knots of genus 3} definable using knotted trivalent graphs.
 Explain in detail why is the set {knots of unknotting number 3} definable using knotted trivalent graphs.
Mandatory but unenforced. Find yourself in the class photo and identify yourself as explained in the photo page.