A Generalization of Turaev's Virtual String Cobracket

Details A Generalization of Turaev's Virtual String Cobracket A Generalization of Turaev's Virtual String Cobracket

2011-07-24

arxiv.org/abs/1107.4718v1

Mathematics

Geometric Topology

30 pages, 12 figures

Scientific paper

In a previous paper, we defined an operation $\mu$ that generalizes Turaev's cobracket for loops on a surface. We showed that, in contrast to the cobracket, this operation gives a formula for the minimum number of self-intersections of a loop in a given free homotopy class. In this paper we consider the corresponding question for virtual strings. We show that $\mu$ gives a bound on the minimal self-intersection number of a virtual string which is stronger than a bound given by Turaev's virtual string cobracket. We use Turaev's based matrices to describe strings $\alpha$ such that $\mu$ gives a formula for the minimal self-intersection number $\alpha$. We also construct an example that shows the bound on the minimal self-intersection number given by $\mu$ is sometimes stronger than the bound $\rho$ given by Turaev's based matrix invariant.

Affiliated with

Also associated with

No associations

Rating

A Generalization of Turaev's Virtual String Cobracket does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generalization of Turaev's Virtual String Cobracket, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalization of Turaev's Virtual String Cobracket will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-76402