Computational topology on knots and spatial graphs
| Project/Area Number |
21500022
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Chuo University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
HARA Masao 東海大学, 理学部, 准教授 (10238165)
谷 聖一 日本大学, 文理学部, 教授 (70266708)
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
TANI Seiichi 日本大学, 文理学部, 教授 (70266708)
|
|---|
| Project Period (FY) |
2009 – 2011
|
| Project Status |
Completed (Fiscal Year 2011)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2009: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
|---|
| Keywords | 計算量理論 / 結び目 / 絡み目 / 位相不変量 / Jones多項式 / 計算量 / アルゴリズム |
|---|
| Research Abstract |
In this research we obtained the followings ; We showed that our algorithm in 2007 computes Jones polynomials of some kinds of links in O(n^2) time, and that there are infinitely many pairs of alternating pretzel knots whose Jones polynomials are identical though whose knot types are different.
|
Report
(4 results)
Research Products
(4 results)
