Computer algebra and colored Jones polynomials

2006 ◽  
Vol 182 (1) ◽  
pp. 804-808 ◽  
Author(s):  
Ismet Altintas
Keyword(s):  
Computer Algebra ◽  
Jones Polynomials ◽  
Colored Jones Polynomials

THE COLORED JONES POLYNOMIALS OF DOUBLES OF KNOTS

2008 ◽  
Vol 17 (08) ◽  
pp. 925-937
Author(s):  
TOSHIFUMI TANAKA
Keyword(s):  
Jones Polynomial ◽  
Colored Jones Polynomial ◽  
Volume Conjecture ◽  
Jones Polynomials ◽  
Skein Theory ◽  
Colored Jones Polynomials

We give formulas for the N-colored Jones polynomials of doubles of knots by using skein theory. As a corollary, we show that if the volume conjecture for untwisted positive (or negative) doubles of knots is true, then the colored Jones polynomial detects the unknot.

scholarly journals THE NON-COMMUTATIVE A-POLYNOMIAL OF TWIST KNOTS

2010 ◽  
Vol 19 (12) ◽  
pp. 1571-1595 ◽  
Author(s):  
STAVROS GAROUFALIDIS ◽  
XINYU SUN
Keyword(s):  
Difference Equation ◽  
Recursion Relation ◽  
Jones Polynomial ◽  
Minimal Order ◽  
Quantum Topology ◽  
And Topology ◽  
Jones Polynomials ◽  
Creative Telescoping ◽  
Colored Jones Polynomials ◽  
Telescoping Method

The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative A-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of the form [Formula: see text] given a recursion relation for [Formula: see text] and the hypergeometric kernel c(n, k). As an application of our method, we explicitly compute the non-commutative A-polynomial for twist knots with -15 and 15 crossings. The non-commutative A-polynomial of a knot encodes the monic, linear, minimal order q-difference equation satisfied by the sequence of colored Jones polynomials of the knot. Its specialization to q = 1 is conjectured to be the better-known A-polynomial of a knot, which encodes important information about the geometry and topology of the knot complement. Unlike the case of the Jones polynomial, which is easily computable for knots with 50 crossings, the A-polynomial is harder to compute and already unknown for some knots with 12 crossings.

ON COMPUTING KAUFFMAN BRACKET POLYNOMIAL OF MONTESINOS LINKS

2010 ◽  
Vol 19 (08) ◽  
pp. 1001-1023 ◽  
Author(s):  
XIAN'AN JIN ◽  
FUJI ZHANG
Keyword(s):  
Closed Form ◽  
Explicit Expression ◽  
Computer Algebra ◽  
Jones Polynomial ◽  
Kauffman Bracket ◽  
Jones Polynomials ◽  
Bracket Polynomial ◽  
Bracket Polynomials ◽  
Closed Form Formula

It is well known that Jones polynomial (hence, Kauffman bracket polynomial) of links is, in general, hard to compute. By now, Jones polynomials or Kauffman bracket polynomials of many link families have been computed, see [4, 7–11]. In recent years, the computer algebra (Maple) techniques were used to calculate link polynomials for various link families, see [7, 12–14]. In this paper, we try to design a maple program to calculate the explicit expression of the Kauffman bracket polynomial of Montesinos links. We first introduce a family of "ring of tangles" links, which includes Montesinos links as a special subfamily. Then, we provide a closed-form formula of Kauffman bracket polynomial for a "ring of tangles" link in terms of Kauffman bracket polynomials of the numerators and denominators of the tangles building the link. Finally, using this formula and known results on rational links, the Maple program is designed.

scholarly journals The colored Jones polynomials and the simplicial volume of a knot

2001 ◽  
Vol 186 (1) ◽  
pp. 85-104 ◽  
Author(s):  
Hitoshi Murakami ◽  
Jun Murakami
Keyword(s):  
Simplicial Volume ◽  
Jones Polynomials ◽  
Colored Jones Polynomials

scholarly journals q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION

2007 ◽  
Vol 16 (03) ◽  
pp. 267-332 ◽  
Author(s):  
LOUIS H. KAUFFMAN ◽  
SAMUEL J. LOMONACO
Keyword(s):  
Quantum Algorithms ◽  
Jones Polynomial ◽  
Braid Groups ◽  
Spin Networks ◽  
Spin Network ◽  
Topological Quantum ◽  
Jones Polynomials ◽  
Topological Quantum Computation ◽  
Bracket Polynomial ◽  
Colored Jones Polynomials

We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket state sum model for the Jones polynomial. We give our results for a large class of representations based on values for the bracket polynomial that are roots of unity. We make a separate and self-contained study of the quantum universal Fibonacci model in this framework. We apply our results to give quantum algorithms for the computation of the colored Jones polynomials for knots and links, and the Witten–Reshetikhin–Turaev invariant of three manifolds.

scholarly journals Turaev–Viro invariants, colored Jones polynomials, and volume

2018 ◽  
Vol 9 (4) ◽  
pp. 775-813 ◽  
Author(s):  
Renaud Detcherry ◽  
Efstratia Kalfagianni ◽  
Tian Yang
Keyword(s):  
Jones Polynomials ◽  
Colored Jones Polynomials
Sign in / Sign up

Export Citation Format

Share Document