書誌事項
- タイトル別名
-
- Computation of the Jones Polynomial
- Jones タコウシキ ノ ケイサン
この論文をさがす
抄録
The Jones polynomial is an invariant in knot theory. It is known that the Jones polynomial of an alternating link is related to the Tutte polynomial in graph theory. Here, it is shown that the new algorithm [11] of computing the Tutte polynomial can be applied to computing the Jones polynomial of an arbitrary link. Although a problem of computing the Jones polynomial is #P-hard, by using the planarity it can be calculated for some large links, say a link whose signed plane graph is a 10 × 10 grid graph and which has 180 crossings. A new result for the case where a knot is represented as a braid is also given.
収録刊行物
-
- 日本応用数理学会論文誌
-
日本応用数理学会論文誌 8 (3), 341-354, 1998
一般社団法人 日本応用数理学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680744487424
-
- NII論文ID
- 110001883696
-
- NII書誌ID
- AN10367166
-
- ISSN
- 09172246
- 24240982
-
- NDL書誌ID
- 4562696
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- CiNii Articles
- Crossref
-
- 抄録ライセンスフラグ
- 使用不可