Related papers: Efficient Computation of the Kauffman Bracket

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…

Given a 4-tangle shadow, we concatenate it with itself n times and form a knot by applying a closure operation that connects each top endpoint to the corresponding bottom endpoint on the same side without introducing any crossings. We then…

Determining the structure of the Kauffman bracket skein module of all $3$-manifolds over the ring of Laurent polynomials $\mathbb Z[A^{\pm 1}]$ is a big open problem in skein theory. Very little is known about the skein module of non-prime…

This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…

We compute the Kauffman bracket skein module of the complement of a twist knot, finding that it is free and infinite dimensional. The basis consists of cables of a two-component link, one component of which is a meridian of the knot. The…

The W-polynomial is applied in two ways to questions involving the Kauffman bracket of some families of links. First we find a geometric property of a link diagram, which is less than or equal to the twist number, that bounds the Mahler…

We calculate the Kauffman bracket skein module (KBSM) of the complement of all two-bridge links. For a two-bridge link, we show that the KBSM of its complement is free over the ring $\BC[t^{\pm 1}]$ and when reducing $t=-1$, it is…

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

In the present paper, we build a bridge between Conway-Coxeter friezes and rational tangles through the Kauffman bracket polynomials. One can compute a Kauffman bracket polynomials attached to rational links by using Conway-Coxeter friezes.…

The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…

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…

We compute the Kauffman bracket polynomial of the numerator and denominator closures of A + A + ... + A ( A is repeated n times), where A is a 2-tangle shadow that has at most 4 crossings.

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…

We use Kauffman's bracket polynomial to define a complex-valued invariant of virtual rational tangles that generalizes the well-known fraction invariant for classical rational tangles. We provide a recursive formula for computing the…

We use recoupling theory to study the Kauffman bracket skein module of the quaternionic manifold over Z[A,A^{-1}] localized by inverting all the cyclotomic polynomials. We prove that the skein module is spanned by five elements. Using the…

This paper is focused on the structure of the Kauffman bracket skein algebra of a punctured surface at roots of unity. A criterion that determines when a collection of skeins forms a basis of the skein algebra as an extension over the…

The Kauffman bracket skein module $S(M)$ of a 3-manifold $M$ is a $\mathbb{Q}(A)$-vector space spanned by links in $M$ modulo the so-called Kauffman relations. In this article, for any closed oriented surface $\Sigma$ we provide an explicit…

In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

In this paper we present two different ways for computing the Kauffman bracket skein module of $S^1\times S^2$, ${\rm KBSM}\left(S^1\times S^2\right)$, via braids. We first extend the universal Kauffman bracket type invariant $V$ for knots…