首页> 外文会议>Discrete Geometry, Combinatorics and Graph Theory; Lecture Notes in Computer Science; 4381 >The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph
【24h】

The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph

机译:链接和通用签名平面图的Kauffman括号多项式

获取原文
获取原文并翻译 | 示例

摘要

In this paper we show that a list of chain polynomials of 6 graphs are sufficient to give all the chain polynomials of signed plane graphs with cyclomatic number 1 — 5 by special parametrization. Using this result the Kauffman bracket polynomials of 801 knots and 1424 links with crossing number no more than 11 can be obtained in a unify way.
机译:在本文中,我们显示了一个由6个图组成的链多项式列表,足以通过特殊参数化给出具有圈数为1-5的带符号平面图的所有链多项式。使用此结果,可以以统一的方式获得801节的考夫曼括号多项式和1424个交叉数不超过11​​的链接。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号