Related papers: Unsigned state models for the Jones polynomial
For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the…
We study the head and tail of the colored Jones polynomial while focusing mainly on alternating links. Various ways to compute the colored Jones polynomial for a given link give rise to combinatorial identities for those power series. We…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
The celebrated Thistlethwaite theorem relates the Jones polynomial of a link with the Tutte polynomial of the corresponding planar graph. We give a generalization of this theorem to virtual links. In this case, the graph will be embedded…
This is a recreational paper showing that certain linked graphs cannot be separated. The proofs employ elementary covering space theory, an appeal to a theorem of Scharlemann (concerning the band sums of two unknots), and a Jones polynomial…
The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the…
In [2] Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph G a polynomial, denoted [G], in three variables, A, B…
We extend the work of Hanlon on the chromatic polynomial of an unlabeled graph to define the unlabeled chromatic polynomial of an unlabeled signed graph. Explicit formulas are presented for labeled and unlabeled signed chromatic polynomials…
Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial…
A. S. Lipson constructed two state models yielding the same classical link invariant obtained from the Kauffman polynomial $F(a,z)$. In this paper, we apply Lipson's state models to marked graph diagrams of surface-links, and observe when…
It is a well known result from Thistlethwaite that the Jones polynomial of a non-split alternating link is alternating. We find the right generalization of this result to the case of non-split alternating tangles. More specifically: the…
This paper defines versions of the Jones polynomial and Khovanov homology by using several maps from the set of Gauss diagrams to its variant. Through calculation of some examples, this paper also shows that these versions behave…
The Jones polynomial and the Kauffman bracket are constructed, and their relation with knot and link theory is described. The quantum groups and tangle functor formalisms for understanding these invariants and their descendents are given.…
We consider the potential function of the colored Jones polynomial for a link with arbitrary colors and obtain the cone-manifold structure for the link complement. In addition, we establish a relationship between a saddle point equation and…
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…
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 use Feynman diagrams to prove a formula for the Jones polynomial of a link derived recently by N.~Reshetikhin. This formula presents the colored Jones polynomial as an integral over the coadjoint orbits corresponding to the…