06-1350/Class Notes for Thursday November 9

From Drorbn
Revision as of 09:23, 9 November 2006 by Drorbn (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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.