Add to ORKGAbstract. 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 converse; if the bounds are sharp then the diagram is semi-adequate. As a result, we use colored Jones link polynomials to extract an invariant that detects semi-adequate links and discuss some applications. 1
Abstract. We study the head and tail of the colored Jones polynomial while focusing mainly on altern...
The colored Jones polynomial assigns to each knot a sequence of Laurent polynomials. This dissertati...
Abstract. We give a refined upper bound for the hyperbolic volume of an alternating link in terms of...
Abstract. We use the colored Jones link polynomials to extract an invariant that detects semi-adequa...
Abstract. We show that the head and tail functions of the colored Jones polynomial of adequate links...
We show that the head and tail functions of the colored Jones polynomial of adequate links are the p...
A combinatorial definition of the optimistic limit of Kashaev invariant was suggested by the author ...
The Jones polynomial is a well-defined invariant of virtual links. We observe the effect of a genera...
In [2] Armond showed that the heads and tails of the colored Jones polynomial exist for adequate lin...
We give an alternate expansion of the colored Jones polynomial of a pretzel link which recovers the ...
We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under ...
This dissertation studies the colored Jones polynomial of knots and links, colored by representation...
Using the colored Kauffman skein relation, we study the highest and lowest 4n coefficients of the nt...
This monograph derives direct and concrete relations between colored Jones polynomials and the topol...
AbstractIn this paper we use the orientation of a link to introduce an additional structure on Kauff...
Abstract. We study the head and tail of the colored Jones polynomial while focusing mainly on altern...
The colored Jones polynomial assigns to each knot a sequence of Laurent polynomials. This dissertati...
Abstract. We give a refined upper bound for the hyperbolic volume of an alternating link in terms of...
Abstract. We use the colored Jones link polynomials to extract an invariant that detects semi-adequa...
Abstract. We show that the head and tail functions of the colored Jones polynomial of adequate links...
We show that the head and tail functions of the colored Jones polynomial of adequate links are the p...
A combinatorial definition of the optimistic limit of Kashaev invariant was suggested by the author ...
The Jones polynomial is a well-defined invariant of virtual links. We observe the effect of a genera...
In [2] Armond showed that the heads and tails of the colored Jones polynomial exist for adequate lin...
We give an alternate expansion of the colored Jones polynomial of a pretzel link which recovers the ...
We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under ...
This dissertation studies the colored Jones polynomial of knots and links, colored by representation...
Using the colored Kauffman skein relation, we study the highest and lowest 4n coefficients of the nt...
This monograph derives direct and concrete relations between colored Jones polynomials and the topol...
AbstractIn this paper we use the orientation of a link to introduce an additional structure on Kauff...
Abstract. We study the head and tail of the colored Jones polynomial while focusing mainly on altern...
The colored Jones polynomial assigns to each knot a sequence of Laurent polynomials. This dissertati...
Abstract. We give a refined upper bound for the hyperbolic volume of an alternating link in terms of...