Dror Bar-Natan: Classes: 2003-04: Math 1350F - Knot Theory:

(34)

Next: Class Notes for Thursday October 30, 2003 Previous: Class Notes for Tuesday October 28, 2003

Homework Assignment 7: so(N)

Assigned Thursday October 30; due Thursday November 6 in class.

This document in PDF: HW.pdf

To be handed in. Describe a simple combinatorial algorithm for the computation of $W_{so(N)}(D)$, where $D$ is an abitrary chord diagram.

Recommended for extra practice. Describe a simple combinatorial algorithm for the computation of $W_{sl(N)}(D)$, where $D$ is an abitrary chord diagram.

Just for fun. A capital letter T is formed from five identical squares, by arranging three squares across the top and two more directly under the center square:

$$\setlength{\unitlength}{6000sp}%% \begin{picture}(474,474)(589,-7... ...framebox (150,150){}} }% {\put(751, 89){\framebox (150,150){}} }% \end{picture}$$

How can the resulting letter be cut into FOUR pieces of identical size and shape? (The pieces may be turned over to check that they are identical.) (Credit: Peter Malcolmson, Wayne State University)

The generation of this document was assisted by L^ATEX2HTML.