2003
DOI: 10.1016/s0096-3003(02)00233-3
|View full text |Cite
|
Sign up to set email alerts
|

Application of computer algebra to Jones polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…By now, Jones polynomials or Kauffman bracket polynomials of many link families have been computed, see [4,[7][8][9][10][11]. In recent years, the computer algebra (Maple) techniques were used to calculate link polynomials for various link families, see [7,[12][13][14]. In this paper, we try to design a maple program to calculate the explicit expression of the Kauffman bracket polynomial of Montesinos links.…”
mentioning
confidence: 99%
“…By now, Jones polynomials or Kauffman bracket polynomials of many link families have been computed, see [4,[7][8][9][10][11]. In recent years, the computer algebra (Maple) techniques were used to calculate link polynomials for various link families, see [7,[12][13][14]. In this paper, we try to design a maple program to calculate the explicit expression of the Kauffman bracket polynomial of Montesinos links.…”
mentioning
confidence: 99%