N股Montesinos纽结的着色Jones多项式  

The Colored Jones Polynomial of N-String Montesinos Knots

作　　者：马郡梓 冷旭东 班子涵 

机构地区：[1]辽宁师范大学数学学院,辽宁 大连

出　　处：《应用数学进展》2024年第1期70-75,共6页Advances in Applied Mathematics

摘　　要：本文运用纽结三价图计算了当n≥4时,n股Montesinos纽结的着色Jones多项式。算法的关键是构造从θ图到n股Montesinos纽结的三价图变换过程,该算法与n=3的情况有着本质不同。In this paper we calculate the colored Jones polynomial of n-string Montesinos knots for n≥4 us-ing knotted trivalent graphs. The key point of the algorithm is to construct the operations from a θ graph to a Montesinos knot, and the algorithm has essential difference with the case n=3 .

关 键 词：着色Jones多项式 纽结三价图 Montesinos纽结 

分 类 号：O18[理学—数学]