Related papers: The Jones Polynomial from a Goeritz Matrix
We derive the Kauffman bracket polynomial for the shadow of the Celtic link $CK_4^{2n}$ using two complementary approaches. The first approach uses a recursive relation within the Celtic framework of Gross and Tucker, based on diagrammatic…
The notion of chckerboard colorability for virtual links and abstract links is introduced. We study the Jones polynomials of virtual links and abstruct links. It is proved that a certain property of the Jones polynomials of classical links…
We study relationships between the colored Jones polynomial and the A-polynomial of a knot. We establish for a large class of 2-bridge knots the AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial.…
A checkerboard graph of a special diagram of an oriented link is made a directed, edge-weighted graph in a natural way so that a principal minor of its Laplacian matrix is a Seifert matrix of the link. Doubling and weighting the edges of…
We define two new invariants for tied links. One of them can be thought as an extension of the Kauffman polynomial and the other one as an extension of the Jones polynomial which is constructed via a bracket polynomial for tied links. These…
In [Duke Math. J. 101 (1999) 359-426], Mikhail Khovanov constructed a homology theory for oriented links, whose graded Euler characteristic is the Jones polynomial. He also explained how every link cobordism between two links induces a…
Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…
We introduce a class of links whose bracket polynomials admit an expansion over perfect matchings of a plane bipartite graph. This class includes 2-bridge links, pretzel links, and Montesinos links. Our first main result (Theorem A)…
Knot Theory is currently a very broad field. Even a long survey can only cover a narrow area. Here we concentrate on the path from Goeritz matrices to quasi-alternating links. On the way, we often stray from the main road and tell related…
We assign a new polynomial to any checkerboard-colorable 4-valent virtual graph in terms of its Euler circuit expansion. This provides a new combinatorial formulation of the Kauffman-Jones polynomial for checkerboard-colorable virtual…
We continue the study of quantum A-polynomials -- equations for knot polynomials with respect to their coloring (representation-dependence) -- as the relations between different links, obtained by hanging additional ``simple'' components on…
We consider hyperbolic links that admit alternating projections on surfaces in compact, irreducible 3-manifolds. We show that, under some mild hypotheses, the volume of the complement of such a link is bounded below in terms of a Kauffman…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
We compute the Jones polynomial for a three-parameter family of links, the twisted torus links of the form $T((p,q),(2,s))$ where $p$ and $q$ are coprime and $s$ is nonzero. When $s = 2n$, these links are the twisted torus knots…
Let $D$ be an oriented classical or virtual link diagram with directed universe $\vec{U}$. Let $C$ denote a set of directed Euler circuits, one in each connected component of $U$. There is then an associated looped interlacement graph…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
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…
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
Pseudo links are equivalence classes under Reidemeister-type moves of link diagrams containing crossings with undefined over and under information. In this paper, we extend the Kauffman bracket and Jones-type polynomials from planar pseudo…
In these notes we review the calculation of Jones polynomials using a matrix representation of the braid group and Temperley-Lieb algebra. The pseudounitary representation that we consider allows constructing ``states'' from the…