scholarly journals Knot polynomials of open and closed curves

2020 ◽  
Vol 476 (2240) ◽  
pp. 20200124
Author(s):  
Eleni Panagiotou ◽  
Louis H. Kauffman
Keyword(s):  
Continuous Function ◽  
Jones Polynomial ◽  
Topological Invariant ◽  
Closed Curves ◽  
Finite Form ◽  
Polygonal Curves ◽  
Open Curve ◽  
Bracket Polynomial

In this manuscript, we introduce a method to measure entanglement of curves in 3-space that extends the notion of knot and link polynomials to open curves. We define the bracket polynomial of curves in 3-space and show that it has real coefficients and is a continuous function of the curve coordinates. This is used to define the Jones polynomial in a way that it is applicable to both open and closed curves in 3-space. For open curves, the Jones polynomial has real coefficients and it is a continuous function of the curve coordinates and as the endpoints of the curve tend to coincide, the Jones polynomial of the open curve tends to that of the resulting knot. For closed curves, it is a topological invariant, as the classical Jones polynomial. We show how these measures attain a simpler expression for polygonal curves and provide a finite form for their computation in the case of polygonal curves of 3 and 4 edges.

scholarly journals Vassiliev measures of complexity of open and closed curves in 3-space

2021 ◽  
Vol 477 (2254) ◽  
Author(s):  
Eleni Panagiotou ◽  
Louis H. Kauffman
Keyword(s):  
Continuous Function ◽  
Jones Polynomial ◽  
Continuous Functions ◽  
Topological Invariant ◽  
Integral Formulation ◽  
Closed Curves ◽  
Vassiliev Invariants ◽  
Polygonal Curves ◽  
Gauss Code

In this article, we define Vassiliev measures of complexity for open curves in 3-space. These are related to the coefficients of the enhanced Jones polynomial of open curves in 3-space. These Vassiliev measures are continuous functions of the curve coordinates; as the ends of the curve tend to coincide, they converge to the corresponding Vassiliev invariants of the resulting knot. We focus on the second Vassiliev measure from the enhanced Jones polynomial for closed and open curves in 3-space. For closed curves, this second Vassiliev measure can be computed by a Gauss code diagram and it has an integral formulation, the double alternating self-linking integral. The double alternating self-linking integral is a topological invariant of closed curves and a continuous function of the curve coordinates for open curves in 3-space. For polygonal curves, the double alternating self-linking integral obtains a simpler expression in terms of geometric probabilities.

ON COMPUTING KAUFFMAN BRACKET POLYNOMIAL OF MONTESINOS LINKS

2010 ◽  
Vol 19 (08) ◽  
pp. 1001-1023 ◽  
Author(s):  
XIAN'AN JIN ◽  
FUJI ZHANG
Keyword(s):  
Closed Form ◽  
Explicit Expression ◽  
Computer Algebra ◽  
Jones Polynomial ◽  
Kauffman Bracket ◽  
Jones Polynomials ◽  
Bracket Polynomial ◽  
Bracket Polynomials ◽  
Closed Form Formula

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.

scholarly journals Introduction to disoriented knot theory

2018 ◽  
Vol 16 (1) ◽  
pp. 346-357
Author(s):  
İsmet Altıntaş
Keyword(s):  
Knot Theory ◽  
Jones Polynomial ◽  
Polynomial Invariants ◽  
Linking Number ◽  
Link Diagrams ◽  
New Ideas ◽  
Numerical Invariants ◽  
Bracket Polynomial ◽  
Knots And Links

AbstractThis paper is an introduction to disoriented knot theory, which is a generalization of the oriented knot and link diagrams and an exposition of new ideas and constructions, including the basic definitions and concepts such as disoriented knot, disoriented crossing and Reidemesiter moves for disoriented diagrams, numerical invariants such as the linking number and the complete writhe, the polynomial invariants such as the bracket polynomial, the Jones polynomial for the disoriented knots and links.

scholarly journals q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION

2007 ◽  
Vol 16 (03) ◽  
pp. 267-332 ◽  
Author(s):  
LOUIS H. KAUFFMAN ◽  
SAMUEL J. LOMONACO
Keyword(s):  
Quantum Algorithms ◽  
Jones Polynomial ◽  
Braid Groups ◽  
Spin Networks ◽  
Spin Network ◽  
Topological Quantum ◽  
Jones Polynomials ◽  
Topological Quantum Computation ◽  
Bracket Polynomial ◽  
Colored Jones Polynomials

We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket state sum model for the Jones polynomial. We give our results for a large class of representations based on values for the bracket polynomial that are roots of unity. We make a separate and self-contained study of the quantum universal Fibonacci model in this framework. We apply our results to give quantum algorithms for the computation of the colored Jones polynomials for knots and links, and the Witten–Reshetikhin–Turaev invariant of three manifolds.

scholarly journals A GEOMETRIC CHARACTERIZATION OF THE UPPER BOUND FOR THE SPAN OF THE JONES POLYNOMIAL

2011 ◽  
Vol 20 (07) ◽  
pp. 1059-1071
Author(s):  
JUAN GONZÁLEZ-MENESES ◽  
PEDRO M. G. MANCHÓN
Keyword(s):  
Upper Bound ◽  
Knot Theory ◽  
Jones Polynomial ◽  
Geometric Proof ◽  
Link Diagram ◽  
Closed Curves ◽  
Number Of Faces ◽  
Alternating Links ◽  
Connected Diagram

Let D be a link diagram with n crossings, sA and sB be its extreme states and |sAD| (respectively, |sBD|) be the number of simple closed curves that appear when smoothing D according to sA (respectively, sB). We give a general formula for the sum |sAD| + |sBD| for a k-almost alternating diagram D, for any k, characterizing this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, yielding |sAD| + |sBD| = n + 2 - 2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu [On Kauffman brackets, J. Knot Theory Ramifications6(1) (1997) 125–148.]. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al. [Almost alternating links, Topology Appl.46(2) (1992) 151–165.], is obtained as a corollary. As a new application, we prove that the Turaev genus is equal to the number k of dealternator crossings for any dealternator connected diagram.

A BRACKET POLYNOMIAL FOR GRAPHS, I

2009 ◽  
Vol 18 (12) ◽  
pp. 1681-1709 ◽  
Author(s):  
LORENZO TRALDI ◽  
LOUIS ZULLI
Keyword(s):  
Equivalence Relation ◽  
Jones Polynomial ◽  
Intersection Graph ◽  
Kauffman Bracket ◽  
Reidemeister Moves ◽  
Gauss Diagram ◽  
Local Complementation ◽  
Bracket Polynomial

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeister equivalence to an equivalence relation on looped graphs. The graph bracket polynomial can be defined recursively using the same pivot and local complementation operations used to define the interlace polynomial, and it gives rise to a graph Jones polynomial VG(t) that is invariant under the graph Reidemeister moves.

ON THE STRUCTURE OF PERIODIC ORBITS ON A SIMPLE BRANCHED MANIFOLD

2010 ◽  
Vol 20 (11) ◽  
pp. 3517-3528 ◽  
Author(s):  
MEHMET ITIK ◽  
STEPHEN P. BANKS
Keyword(s):  
Periodic Solutions ◽  
Periodic Orbits ◽  
Symbolic Dynamics ◽  
Chaotic Attractor ◽  
New Method ◽  
Cancer Model ◽  
Closed Curves ◽  
Knot Invariant ◽  
Bracket Polynomial ◽  
Symbol Sequences

We study the structure of the periodic orbits on a simple branched manifold which is a subtemplate of the branched manifold of the chaotic attractor that is obtained from a cancer model. We indicate the conditions for the knotted and linked periodic orbits by using symbolic dynamics, then we extend the results to the periodic solutions of the chaotic attractor. Furthermore, we compare the knots obtained by using same symbol sequences for the simple branched manifold and the attractor's branched manifold by using a knot invariant, specifically, we calculate the Kauffman bracket polynomial. In order to count the number of closed curves which is required to calculate the bracket polynomial we propose a new method which uses cyclic permutations.

scholarly journals A remarkable 20-crossing tangle

2017 ◽  
Vol 26 (14) ◽  
pp. 1750091
Author(s):  
Shalom Eliahou ◽  
Jean Fromentin
Keyword(s):  
Positive Integer ◽  
Jones Polynomial ◽  
Kauffman Bracket ◽  
Polynomial Formula ◽  
Bracket Polynomial

For any positive integer [Formula: see text], we exhibit a prime knot [Formula: see text] with [Formula: see text] crossings whose Jones polynomial [Formula: see text] is equal to [Formula: see text] modulo [Formula: see text]. Our construction rests on a certain [Formula: see text]-crossing prime tangle [Formula: see text] which is undetectable by the Kauffman bracket polynomial pair mod [Formula: see text].

An upper bound for the breadth of the Jones polynomial

1988 ◽  
Vol 103 (3) ◽  
pp. 451-456 ◽  
Author(s):  
Morwen B. Thistlethwaite
Keyword(s):  
Simple Proof ◽  
Upper Bound ◽  
Recent Article ◽  
Jones Polynomial ◽  
Upper Bounds ◽  
The Other ◽  
Link Diagram ◽  
Kauffman Bracket ◽  
Bracket Polynomial ◽  
Connected Diagram

In the recent article [2], a kind of connected link diagram called adequate was investigated, and it was shown that the Jones polynomial is never trivial for such a diagram. Here, on the other hand, upper bounds are considered for the breadth of the Jones polynomial of an arbitrary connected diagram, thus extending some of the results of [1,4,5]. Also, in Theorem 2 below, a characterization is given of those connected, prime diagrams for which the breadth of the Jones polynomial is one less than the number of crossings; recall from [1,4,5] that the breadth equals the number of crossings if and only if that diagram is reduced alternating. The article is concluded with a simple proof, using the Jones polynomial, of W. Menasco's theorem [3] that a connected, alternating diagram cannot represent a split link. We shall work with the Kauffman bracket polynomial 〈D〉 ∈ Z[A, A−1 of a link diagram D.

Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory

2009 ◽  
Vol 19 (3) ◽  
pp. 343-369 ◽  
Author(s):  
Y. DIAO ◽  
G. HETYEI
Keyword(s):  
Knot Theory ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Ribbon Graph ◽  
Virtual Knot ◽  
Tree Expansion ◽  
The Face ◽  
Tutte Polynomials ◽  
Bracket Polynomial ◽  
Virtual Knot Theory

We introduce the concept of a relative Tutte polynomial of coloured graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this subject. We then apply the relative Tutte polynomial to virtual knot theory. More specifically, we show that the Kauffman bracket polynomial (and hence the Jones polynomial) of a virtual knot can be computed from the relative Tutte polynomial of its face (Tait) graph with some suitable variable substitutions. Our method offers an alternative to the ribbon graph approach, using the face graph obtained from the virtual link diagram directly.

Sign in / Sign up

Export Citation Format

Share Document