• Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.


PO is now at the Physics Department of Bielefeld University!

New printer friendly PO pages!

Migration to Bielefeld University was successful!

Please vote for this year's PhysicsOverflow ads!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback


(propose a free ad)

Site Statistics

205 submissions , 163 unreviewed
5,064 questions , 2,215 unanswered
5,347 answers , 22,743 comments
1,470 users with positive rep
818 active unimported users
More ...

  On finding A-polynomials

+ 5 like - 0 dislike

I have two questions to obtain the explicit forms of A-polynomials.

Takata used the mathematica pacage qMultisum.m to obtain the recursion relation of the colored Jones polynomials for twist knots. As Stavros Garoufalidis and Xinyu Sun pointed out in this paper, the simple use of the mathematica pacage qZeil.m, qMultisum.m does not give the recursion relation of minimal order. They made use of the method, so-called creative telescoping, to get the recursion relation of minimal order by using the certificat function.

  1. How do you implement this method in Mathematica, say, to get the recursion relation for $5_2$ and $6_1$ knots as in p.4 of the paper?

Recently, Gukov, Sulkowski and Fuji conjecture that, in the limit, \begin{equation} q = e^{\hbar} \to 1 \,, \qquad a = \text{fixed} \,, \qquad t = \text{fixed} \,, \qquad x = q^n = \text{fixed} \end{equation} the $n$-colored superpolynomials $P_n (K;a,q,t)$ exhibit the following ``large color'' behavior: \begin{equation} P_n (K;a,q,t) \;\overset{{n \to \infty \atop \hbar \to 0}}{\sim}\; \exp\left( \frac{1}{\hbar} \int \log y \frac{dx}{x} \,+\, \ldots \right) \end{equation} where ellipsis stand for regular terms (as $\hbar \to 0$) and the leading term is given by the integral on the zero locus of the super-$A$-polynomial: \begin{equation} A^{\text{super}} (x,y;a,t) \; = \; 0 \ . \end{equation}

For example, the critical points of the leading term of colored superpolynomials of torus knots $T^{2,2p+1}$ are give by \begin{eqnarray} 1 \; &=& \; -\frac{t^{-2-2p}(x-z_0)z_0^{-1-2p}(-1+t^2z_0)(1+ at^3 xz_0)}{(-1+z_0)(atx+z_0)(-1 + t^2 x z_0)} \cr y(x,t,a)&=& \frac{a^p t^{2 + 2 p} (-1 + x) x^{1 + 2 p} (atx + z_0) (1 + a t^3 x z_0)}{(1 + a t^3 x) (x - z_0) (-1 + t^2 x z_0)} , \end{eqnarray} which is written in Eq.(2.35) and (2.36). By eliminating $z_0$, you will obtain the super-$A$-polynomials for torus knots $T^{2,2p+1}$. Off course, it should be doable in principle, but

$2$. how can it be implemented explicitly to obtain the super-$A$-polynomials as in Table 5 of this paper? In other words, how do you explicitly eliminate $z_0$ in such a way that you will obtain the super-$A$-polynomials?

I have the same problem to obtain the $Q$-deformed $A$-polynomials from Eq.(A.21) in this paper.

This post imported from StackExchange MathOverflow at 2014-09-25 20:31 (UTC), posted by SE-user Satoshi Nawata

asked Jul 30, 2012 in Mathematics by Satoshi Nawata (75 points) [ revision history ]
edited Sep 25, 2014 by Dilaton
I would suggest adding some tag referencing computation, implementation, Mathematica, or even qmultisum.

This post imported from StackExchange MathOverflow at 2014-09-25 20:31 (UTC), posted by SE-user B. Bischof
Tags edited, with the desirable side-effect of bumping the question.

This post imported from StackExchange MathOverflow at 2014-09-25 20:31 (UTC), posted by SE-user Daniel Moskovich

Your answer

Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead.
To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
Please consult the FAQ for as to how to format your post.
This is the answer box; if you want to write a comment instead, please use the 'add comment' button.
Live preview (may slow down editor)   Preview
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
Please complete the anti-spam verification

user contributions licensed under cc by-sa 3.0 with attribution required

Your rights