A bridge between Conway–Coxeter friezes and rational tangles through the Kauffman bracket polynomials

In this paper, we build a bridge between Conway–Coxeter friezes (CCFs) and rational tangles through the Kauffman bracket polynomials. One can compute a Kauffman bracket polynomial attached to rational links by using CCFs. As an application, one can give a complete invariant on CCFs of zigzag-type.

Characterization of signed Gauss paragraphs and skew-symmetric graded matrices

In this paper, we use theory of embedded graphs on oriented and compact [Formula: see text]-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a function of the maximum number of Carter’s circles. For the case of signed Gauss words, we use a generating set of [Formula: see text], given in [G. Cairns and D. Elton, The Planarity problem for signed Gauss world, J. Knots Theor. Ramif. 2(4) (1993) 359–367], and the intersection pairing of immersed [Formula: see text]-normal curves to present a short solution of the signed Gauss word problem. We relate this solution with the one given by Cairns and Elton. Moreover, we define the join operation on signed Gauss paragraphs to produce signed Gauss words such that both can be realized on the same minimal genus [Formula: see text]-surface. We connect the characterization of signed Gauss paragraph with the recognition virtual links problem. Also we present a combinatorial algorithm to compute, in an easier way, skew-symmetric graded matrices [V. Turaev, Cobordism of knots on surfaces, J. Topol. 1(2) (2008) 285–305] for virtual knots through the concept of triplets [M. Toro and J. Rodríguez, Triplets associated to virtual knot diagrams, Rev. Integración (2011)]. Therefore, we can prove that the Kishino’s knot is not classical, moreover, we prove that the virtual knots of the family [Formula: see text] given in [H. A. Dye, Virtual knots undetected by [Formula: see text] and [Formula: see text]-strand bracket polynomials, Topol. Appl. 153 (2005) 141–160] are not classical knots.

The Kauffman bracket ideal for genus-1 tangles

Given a compact oriented 3-manifold M in S3 with boundary, an (M, 2n)-tangle [Formula: see text] is a 1-manifold with 2n boundary components properly embedded in M. We say that [Formula: see text] embeds in a link L in S3 if [Formula: see text] can be completed to L by a 1-manifold with 2n boundary components exterior to M. The link L is called a closure of [Formula: see text]. We define the Kauffman bracket ideal of [Formula: see text] to be the ideal [Formula: see text] of ℤ[A, A-1] generated by the reduced Kauffman bracket polynomials of all closures of [Formula: see text]. If this ideal is non-trivial, then [Formula: see text] does not embed in the unknot. We give an algorithm for computing a finite list of generators for the Kauffman bracket ideal of any (S1 × D2, 2)-tangle, also called a genus-1 tangle, and give an example of a genus-1 tangle with non-trivial Kauffman bracket ideal. Furthermore, we show that if a single-component genus-1 tangle [Formula: see text] can be obtained as the partial closure of a (B3, 4)-tangle [Formula: see text], then [Formula: see text].

ON COMPUTING KAUFFMAN BRACKET POLYNOMIAL OF MONTESINOS LINKS

It is well known that Jones polynomial (hence, Kauffman bracket polynomial) of links is, in general, hard to compute. By now, Jones polynomials or Kauffman bracket polynomials of many link families have been computed, see [4, 7–11]. In recent years, the computer algebra (Maple) techniques were used to calculate link polynomials for various link families, see [7, 12–14]. In this paper, we try to design a maple program to calculate the explicit expression of the Kauffman bracket polynomial of Montesinos links. We first introduce a family of "ring of tangles" links, which includes Montesinos links as a special subfamily. Then, we provide a closed-form formula of Kauffman bracket polynomial for a "ring of tangles" link in terms of Kauffman bracket polynomials of the numerators and denominators of the tangles building the link. Finally, using this formula and known results on rational links, the Maple program is designed.