On arrow polynomials of checkerboard colorable virtual links
On arrow polynomials of checkerboard colorable virtual links
复制标题
DOI：
10.1142/s021821652150053x
复制
发表时间：
2020-02
影响因子：
0.5
通讯作者：
Qingying Deng;Xian'an Jin;L. Kauffman
中科院分区：
文献类型：
--
作者：
Qingying Deng;Xian'an Jin;L. Kauffman
本文分别利用虚链路的奇扭和箭头多项式给出了两个新的判定虚链路棋盘可染性的判据。其结果是，我们证明了6个虚拟节点是不是棋盘着色，只留下一个虚拟节点的棋盘着色是未知的所有虚拟节点中的四个经典的交叉。
In this paper, we give two new criteria of detecting the checkerboard colorability of virtual links by using the odd writhe and the arrow polynomial of virtual links, respectively. As a result, we prove that 6 virtual knots are not checkerboard colorable, leaving only one virtual knot whose checkerboard colorability is unknown among all virtual knots up to four classical crossings.