# Jaeger composition product

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A formula for the Jones–Conway polynomial, describing it as a sum of products of the Jones–Conway polynomials of pieces of the diagram. It has its root in the statistical mechanics model of the Jones–Conway polynomial by V.F.R. Jones. It has been applied to periodic links and to the building of a Hopf algebra structure on the Jones–Conway skein module of the product of a surface and an interval [a3], [a4], [a2].

To define the Jaeger composition product it is convenient to work with the following regular isotopy variant of the Jones–Conway polynomial:

\begin{equation*} Q _ { D } ( v , z ) = z ^ { \operatorname { com } ( D ) - 1 } v ^ { - \operatorname { Tait } ( D ) } ( v ^ { - 1 } - v ) P _ { D } ( v , z ), \end{equation*}

where $\operatorname { com }( D )$ is the number of link components and $\operatorname{Tait}( D )$ is the algebraic sum of the signs of the crossings of $D$. It is also convenient to add the empty link, $\emptyset$, to the set of links and put $Q _ { \emptyset } ( v , z ) = 1$. $Q _ { D } ( v , z )$ satisfies the skein relation

\begin{equation*} Q _ { D _ { + } } - Q _ { D _ { - } } = \left\{ \begin{array} { l } { Q _ { D _ { 0 } } } \text{ for a self}\square\text{ crossing}, \\ { z ^ { 2 } Q _ { D _ { 0 } } }\text{ for a mixed crossing}, \end{array} \right. \end{equation*}

and $Q _ { D \cup 0 } = ( v ^ { - 1 } - v ) Q _ { D }$. The advantage of working with $Q _ { D } ( v , z )$ is that $Q _ { D } ( v , z ) \in \mathbf{Z} [ v ^ { \pm 1 } , z ^ { 2 } ]$ (no negative powers of $z$) and that the Jaeger composition product has a nice simple form. Indeed ([a1]): Let $D$ be a diagram of an oriented link in $S ^ { 3 }$, then

\begin{equation*} Q _ { D } ( v _ { 1 } v _ { 2 } , z ) = \sum _ { f \in \text{lbl} ( D ) } \end{equation*} The meaning of the used symbols is as follows. To define $\operatorname{lbl} ( D )$, consider $D$ as a $4$-valent graph. Let $\operatorname{Edge}( D )$ denote the set of edges of the graph $D$. A $2$-labelling of $D$ is a function $f : \text { Edge } ( D ) \rightarrow \{ 1,2 \}$ such that around a vertex the following labellings are allowed: Figure: j130010a

The set of $2$-labellings of $D$ is denoted by $\operatorname{lbl} ( D )$. The edges of $D$ with label $i$ form an oriented link diagram, denoted by $D _ { f , i }$. The vertices of $D$ which are neither in $D _{f , 1}$ nor $D_{f , 2}$ are called $f$-smoothing vertices of $D$. Let $| f | _ { - }$ (respectively, $| f |_{ +}$) denote the number of negative (respectively, positive) $f$-smoothing vertices of $D$. Let $| f | = | f |_{ -} + | f |_{+}$ and define $\langle D | f \rangle = ( - 1 ) ^ { | f | } - z ^{ | f | - \operatorname { com } ( D _ { f , 1 } ) - \operatorname { com } ( D _ { f , 2 } ) + \operatorname { com } ( D )}$. Finally, $\operatorname{rot} ( D )$ denotes the rotational number of $D$, i.e. the sum of the signs of the Seifert circles of $D$, where the sign of such a circle is $1$ if it is oriented counterclockwise and $- 1$ otherwise.

How to Cite This Entry:
Jaeger composition product. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Jaeger_composition_product&oldid=50830
This article was adapted from an original article by Jozef Przytycki (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article