# Knot at Lunch, June 28, 2007

## Invitation

Dear Knot at Lunch People,

We will have the fourth of our weekly summer lunches on Thursday June 28, 2007, at the usual place, Bahen 6180, at 12 noon, though this time it will be a short meeting - I'd like to attend a lecture at the Fields Institute at 1PM (titled "Proof of Banach-Tarski paradox") so we have to finish before that.

As always, please bring brown-bag lunch and fresh ideas. I have a few ideas for the agenda: a bit of propaganda about computing, and some words about an email I sent Dylan a few days ago (attached below). But of course, we may end up talking about something else.

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.

Dylan,

In all things finite type (and elsewhere in knot theory) braids have always been one of the simplest examples.

So here's a bunch of *specific* questions:

What are virtual braids? Can they be combed? What are finite type invariants of virtual braids? Is there a structure-preserving universal finite type invariant of virtual braids? Does it separate virtual braids? Does every finite type invariant of braids extends to a finite type invariant of virtual braids, of the same degree? Do "Lie-bialgebraic" weight systems span all weight systems, for virtual braids? Can you write honest formulas in terms of arrow diagrams for an R-matrix?

Dror.

## Some Content

When will it finally be easy to draw on a computer? |

**Definition.** The pure virtual braid group on strands is the group generated by symbols for (standing for "strand goes over strand from λeft to right and returning virtually") and (standing for "strand goes over strand from ρight to left, virtual return") modulo the relations:

- .
- (where are distinct; variants: and ).
- (where are distinct; variants?).

When will it finally be easy to draw on a computer? |

At least at a naive level, the corresponding algebra of chord diagrams is generated by degree 1 symbols (corresponding to ) and (corresponding to ) subject to the relations:

- (and hence the 's can henceforth be ignored).
- .
- .

## References

The "computing" subject is around Some One Parameter Knot Theory Computations by Dror Bar-Natan and Thomas Fiedler.
The defining work on virtual knots is Kauffman's *Virtual Knot Theory*,
Europ. J. Combinatorics **20** (1999) 663–691.
Other highly relevant papers are Goussarov-Polyak-Viro's *Finite Type Invariants of Classical and Virtual Knots*, arXiv:math/9810073 and Polyak's *On the Algebra of Arrow Diagrams*, Letters in Mathematical Physics **51-4** (2000) 275-291.