AKT-14/Homework Assignment 1: Difference between revisions

From Drorbn
Jump to navigationJump to search
No edit summary
No edit summary
Line 10: Line 10:


B. Prove that <math>\lambda(K)</math> is computable in polynomial time in the number of crossings of <math>K</math>.
B. Prove that <math>\lambda(K)</math> is computable in polynomial time in the number of crossings of <math>K</math>.

'''Question 2.''' Using combinatorics alone prove that given a 2-component link diagram <math>D</math>, with components <math>\gamma_1</math> and <math>\gamma_2</math>,

<div align=center>
<math>\frac12\sum_{\text{xings }x\text{ between }\gamma_1\text{ and }\gamma_2}(-1)^x</math>
<math>= \sum_{\text{xings }x\text{ with }\gamma_1\text{ over }\gamma_2}(-1)^x</math>
<math>= \sum_{\text{xings }x\text{ with }\gamma_2\text{ over }\gamma_1}(-1)^x</math>
</div>

'''Question 2.'''

Revision as of 10:36, 13 January 2014

This assignment is due in class on Monday January 20. Here and everywhere, neatness counts!! You may be brilliant and you may mean just the right things, but if the your readers will be having hard time deciphering your work they will give up and assume it is wrong.

This assignment was written on the HW session of Friday January 10. See BBS/AKT14-140110-191441.jpg, BBS/AKT14-140110-192041.jpg, and BBS/AKT14-140110-192042.jpg.

Question 1.

A. Prove that the set of all 3-colourings of a knot diagram is a vector space over . Hence is always a power of 3.

B. Prove that is computable in polynomial time in the number of crossings of .

Question 2. Using combinatorics alone prove that given a 2-component link diagram , with components and ,

Question 2.