A Generalization of Turaev's Virtual String Cobracket

Original · EN

In a previous paper, we defined an operation μ 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 μ 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 α such that μ gives a formula for the minimal self-intersection number α. We also construct an example that shows the bound on the minimal self-intersection number given by μ is sometimes stronger than the bound ρ given by Turaev's based matrix invariant.