The non-commutative $A$-polynomial of $(-2,3,n)$ pretzel knots

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 8 figures

Scientific paper

We study $q$-holonomic sequences that arise as the colored Jones polynomial of knots in 3-space. The minimal-order recurrence for such a sequence is called the (non-commutative) $A$-polynomial of a knot. Using the \emph{method of guessing}, we obtain this polynomial explicitly for the $K_p=(-2,3,3+2p)$ pretzel knots for $p=-5,...,5$. This is a particularly interesting family since the pairs $(K_p,-K_{-p})$ are geometrically similar (in particular, scissors congruent) with similar character varieties. Our computation of the non-commutative $A$-polynomial (a) complements the computation of the $A$-polynomial of the pretzel knots done by the first author and Mattman, (b) supports the AJ Conjecture for knots with reducible $A$-polynomial and (c) numerically computes the Kashaev invariant of pretzel knots in linear time. In a later publication, we will use the numerical computation of the Kashaev invariant to numerically verify the Volume Conjecture for the above mentioned pretzel knots.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The non-commutative $A$-polynomial of $(-2,3,n)$ pretzel knots does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The non-commutative $A$-polynomial of $(-2,3,n)$ pretzel knots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The non-commutative $A$-polynomial of $(-2,3,n)$ pretzel knots will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-79561

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.