Knot at Lunch, July 19, 2007: Difference between revisions

From Drorbn
Jump to navigationJump to search
No edit summary
 
(One intermediate revision by the same user not shown)
Line 14: Line 14:


Dror.
Dror.

==Content==

===Handout===

<center>[[Image:Fionntan on GPV July 19 2007.jpg|400px]]</center>

===Blackboard Shots===

<center>[[Image:DSC01255.jpg|600px]]</center>
<p>
<center>[[Image:DSC01256.jpg|450px]]</center>

==Question==

Can you find subdiagram formulas (in the style of GPV, {{arXiv|math/9810073}}) for finite type invariants of braids, homotopy string links and links? Traditionally in knot theory, the first two of the above classes are easier than knots but the last is harder.

Latest revision as of 08:05, 24 July 2007

Invitation

Dear Knot at Lunch People,

We will have our next summer lunch on Thursday July 19, 2007, at the usual place, Bahen 6180, at 12 noon. But note that for the three weeks after that I will be traveling (in China and Vietnam) so any Knot at Lunch meetings in that period will be Dror-free. The following likely date for a regular Knot at Lunch meeting is August 16, 2007.

As always, please bring brown-bag lunch and fresh ideas. This time we have a fixed agenda! Fionntan Roukema will be telling us about subdiagram formulas for finite type invariants, following Goussarov-Polyak-Viro's arXiv:math/9810073.

As always, if you know anyone I should add to this mailing list or if you wish to be removed from this mailing list please let me know. To prevent junk accumulation in mailboxes, I will actively remove inactive people unless they request otherwise.

Best,

Dror.

Content

Handout

Fionntan on GPV July 19 2007.jpg

Blackboard Shots

DSC01255.jpg

DSC01256.jpg

Question

Can you find subdiagram formulas (in the style of GPV, arXiv:math/9810073) for finite type invariants of braids, homotopy string links and links? Traditionally in knot theory, the first two of the above classes are easier than knots but the last is harder.