Related papers: The Jones polynomial and graphs on surfaces
In this note we define a polynomial invariant for colored links by a skein relation. It specializes to the Jones polynomial for classical links.
We calculate Jones polynomials $V(H_r,t)$ for a family of alternating knots and links $H_r$ with arbitrarily many crossings $r$, by computing the Tutte polynomials $T(G_+(H_r),x,y)$ for the associated graphs $G_+(H_r)$ and evaluating these…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
The discovery of polynomial invariants of knots and links, ignited by V. F. R. Jones, leads to the formulation of polynomial invariants of spatial graphs. The Yamada polynomial, one of such invariants, is frequently utilized for practical…
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…
We show that for a twist knot, the A-polynomial can be obtained from recurrences for the summand in Masbaum's formula of the colored Jones polynomial. Our result supports the AJ conjecture due to S.Garoufalidis.
We utilize the trip matrix method of calculating the Jones Polynomial to give an alternative proof that the Jones Polynomial is multiplicative under connect sums.
We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow's homological definition of the Jones polynomial and Kauffman's definition of the Jones polynomial.…
We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several…
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…
We formulate the holographic principle for knots and links. For the "space" of all knots and links, torus knots T(2m+1,2) and torus links L(2m,2) play the role of the "boundary" of this space. Using the holographic principle, we find the…
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…
Although most knots are nonalternating, modern research in knot theory seems to focus on alternating knots. We consider here nonalternating knots and their properties. Specifically, we show certain classes of knots have nontrivial Jones…
We study the structure of the stable coefficients of the Jones polynomial of an alternating link. We start by identifying the first four stable coefficients with polynomial invariants of a (reduced) Tait graph of the link projection. This…
For every n-component ribbon link L we prove that the Jones polynomial V(L) is divisible by the polynomial V(O^n) of the trivial link. This integrality property allows us to define a generalized determinant det V(L) := [V(L)/V(O^n)]_(t=-1),…
The Jones polynomial of a knot in 3-space is a Laurent polynomial in $q$, with integer coefficients. Many people have pondered why is this so, and what is a proper generalization of the Jones polynomial for knots in other closed…
We give characterizations of the skein polynomial for links (as well as Jones and Alexander-Conway polynomials derivable from it), avoiding the usual "smoothing of a crossing" move. As by-products we have characterizations of these…
We use the machinery of categorified Jones-Wenzl projectors to construct a categorification of a type A Reshetikhin-Turaev invariant of oriented framed tangles where each strand is labeled by an arbitrary finite-dimensional representation.…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…