06-1350/Class Notes for Thursday November 9: Difference between revisions
From Drorbn
Jump to navigationJump to search
No edit summary |
No edit summary |
||
Line 4: | Line 4: | ||
Today's handout was taken from [http://www.math.toronto.edu/~drorbn/Talks/HUJI-001116/index.html Talks: HUJI-001116 (Knotted Trivalent Graphs, Tetrahedra and Associators)]. |
Today's handout was taken from [http://www.math.toronto.edu/~drorbn/Talks/HUJI-001116/index.html Talks: HUJI-001116 (Knotted Trivalent Graphs, Tetrahedra and Associators)]. |
||
==Optimistic Agenda== |
|||
* Review of our strategy of obtaining the necessary relations between <math>T</math> and <math>\Phi</math> |
|||
* The "algorithm" is independent of the choices in it. |
|||
* The relations corresponding to the Reidemeister moves. |
|||
* The relations corresponding to the TG operations. |
|||
* Sweeping clean a tree and TS-algebras. |
|||
* The relations using the language of TS algebras. |
Revision as of 22:53, 8 November 2006
|
In Preparation
The information below is preliminary and cannot be trusted! (v)
Today's handout was taken from Talks: HUJI-001116 (Knotted Trivalent Graphs, Tetrahedra and Associators).
Optimistic Agenda
- Review of our strategy of obtaining the necessary relations between and
- The "algorithm" is independent of the choices in it.
- The relations corresponding to the Reidemeister moves.
- The relations corresponding to the TG operations.
- Sweeping clean a tree and TS-algebras.
- The relations using the language of TS algebras.