Search arXivSearch

arXiv · math/0504305

The C-polynomial of a knot

Abstract

In an earlier paper the first author defined a non-commutative A-polynomial for knots in 3-space, using the colored Jones function. The idea is that the colored Jones function of a knot satisfies a non-trivial linear q-difference equation. Said differently, the colored Jones function of a knot is annihilated by a non-zero ideal of the Weyl algebra which is generalted (after localization) by the non-commutative A-polynomial of a knot. In that paper, it was conjectured that this polynomial (which has to do with representations of the quantum group U_q(SL_2)) specializes at q=1 to the better known A-polynomial of a knot, which has to do with genuine SL_2(C) representations of the knot complement. Computing the non-commutative A-polynomial of a knot is a difficult task which so far has been achieved for the two simplest knots. In the present paper, we introduce the C-polynomial of a knot, along with its non-commutative version, and give an explicit computation for all twist knots. In a forthcoming paper, we will use this information to compute the non-commutative A-polynomial of twist knots. Finally, we formulate a number of conjectures relating the A, the C-polynomial and the Alexander polynomial, all confirmed for the class of twist knots.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stavros Garoufalidis, Xinyu Sun. 2009-04-30. The C-polynomial of a knot. https://doi.org/10.2140/agt.2006.6.1623

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT