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 1: | Line 1: | ||
{{06-1350/Navigation}} |
{{06-1350/Navigation}} |
||
{{In Preparation}} |
|||
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== |
==Optimistic Agenda== |
||
* Review of our strategy of obtaining the necessary relations between <math>T</math> and <math>\Phi</math> |
* 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 "algorithm" is independent of the choices in it. |
||
* Planar algebras. Specifically, the planar algebra of tangles, of chord diagrams and of shielded chord diagrams. |
|||
* The relations corresponding to the Reidemeister moves. |
* The relations corresponding to the Reidemeister moves. |
||
* The relations corresponding to the TG operations. |
* The relations corresponding to the TG operations. |
Latest revision as of 09:23, 9 November 2006
|
Optimistic Agenda
- Review of our strategy of obtaining the necessary relations between and
- The "algorithm" is independent of the choices in it.
- Planar algebras. Specifically, the planar algebra of tangles, of chord diagrams and of shielded chord diagrams.
- 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.