TY - JOUR

T1 - The generalized Yamada polynomials of virtual spatial graphs

AU - Deng, Qingying

AU - Jin, Xian'an

AU - Kauffman, Louis H.

N1 - Publisher Copyright: © 2019 Elsevier B.V.

PY - 2019/4/1

Y1 - 2019/4/1

N2 - Knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined and generalized them to virtual spatial graph theory in a combinatorial way and extended the Yamada polynomial from spatial graphs to virtual spatial graphs by ignoring virtual crossings. In this paper, we introduce a topological definition of the virtual spatial graph which is similar to that of a virtual link. Our main goal is to generalize the Yamada polynomial from spatial graphs to virtual spatial graphs such that it could capture the virtuality. It is realized via adding a new variable and integrating the topological Tutte polynomial instead of the Tutte polynomial into our polynomial. We define the generalized Yamada polynomial for virtual spatial graphs via their diagrams and prove that it can be normalized to be a rigid vertex isotopic invariant of virtual spatial graphs and to be a pliable vertex isotopic invariant for virtual spatial graphs with maximum degree at most 3. We consider the connection and difference between our generalized Yamada polynomial and the Dubrovnik polynomial of a classical link, and proved the generalized Yamada polynomial specializes to a version of the Dubrovnik polynomial for classical links which can be used to sometimes detect the virtuality of virtual links. We also prove the generalized Yamada polynomial specializes to the bracket polynomial of the associated diagram obtained from a virtual spatial graph diagram with the Jones–Wenzl projector P 2 acting on it, which can be used to write a program for calculating this special parametrization of the generalized Yamada polynomial based on Mathematica Code.

AB - Knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined and generalized them to virtual spatial graph theory in a combinatorial way and extended the Yamada polynomial from spatial graphs to virtual spatial graphs by ignoring virtual crossings. In this paper, we introduce a topological definition of the virtual spatial graph which is similar to that of a virtual link. Our main goal is to generalize the Yamada polynomial from spatial graphs to virtual spatial graphs such that it could capture the virtuality. It is realized via adding a new variable and integrating the topological Tutte polynomial instead of the Tutte polynomial into our polynomial. We define the generalized Yamada polynomial for virtual spatial graphs via their diagrams and prove that it can be normalized to be a rigid vertex isotopic invariant of virtual spatial graphs and to be a pliable vertex isotopic invariant for virtual spatial graphs with maximum degree at most 3. We consider the connection and difference between our generalized Yamada polynomial and the Dubrovnik polynomial of a classical link, and proved the generalized Yamada polynomial specializes to a version of the Dubrovnik polynomial for classical links which can be used to sometimes detect the virtuality of virtual links. We also prove the generalized Yamada polynomial specializes to the bracket polynomial of the associated diagram obtained from a virtual spatial graph diagram with the Jones–Wenzl projector P 2 acting on it, which can be used to write a program for calculating this special parametrization of the generalized Yamada polynomial based on Mathematica Code.

KW - Dubrovnik polynomial

KW - Generalized Yamada polynomial

KW - Jones–Wenzl projector

KW - Virtual spatial graph

KW - DIAGRAMS

KW - INVARIANTS

KW - Jones-Wenzl projector

KW - KNOTS

UR - http://www.scopus.com/inward/record.url?scp=85061328642&partnerID=8YFLogxK

U2 - 10.1016/j.topol.2019.01.003

DO - 10.1016/j.topol.2019.01.003

M3 - Article

AN - SCOPUS:85061328642

VL - 256

SP - 136

EP - 158

JO - Topology and its Applications

JF - Topology and its Applications

SN - 0166-8641

ER -