scholarly journals Extending quasi-alternating links

2020 ◽  
Vol 29 (11) ◽  
pp. 2050072
Author(s):  
Nafaa Chbili ◽  
Kirandeep Kaur
Keyword(s):  
Jones Polynomial ◽  
Alternating Links ◽  
Alternating Link ◽  
Torus Links

Champanerkar and Kofman [Twisting quasi-alternating links, Proc. Amer. Math. Soc. 137(7) (2009) 2451–2458] introduced an interesting way to construct new examples of quasi-alternating links from existing ones. Actually, they proved that replacing a quasi-alternating crossing [Formula: see text] in a quasi-alternating link by a rational tangle of same type yields a new quasi-alternating link. This construction has been extended to alternating algebraic tangles and applied to characterize all quasi-alternating Montesinos links. In this paper, we extend this technique to any alternating tangle of same type as [Formula: see text]. As an application, we give new examples of quasi-alternating knots of 13 and 14 crossings. Moreover, we prove that the Jones polynomial of a quasi-alternating link that is obtained in this way has no gap if the original link has no gap in its Jones polynomial. This supports a conjecture introduced in [N. Chbili and K. Qazaqzeh, On the Jones polynomial of quasi-alternating links, Topology Appl. 264 (2019) 1–11], which states that the Jones polynomial of any prime quasi-alternating link except [Formula: see text]-torus links has no gap.

scholarly journals Writhe-like invariants of alternating links

2021 ◽  
Vol 30 (01) ◽  
pp. 2150004
Author(s):  
Yuanan Diao ◽  
Van Pham
Keyword(s):  
Jones Polynomial ◽  
Link Diagram ◽  
Link Invariant ◽  
Link Invariants ◽  
Link Diagrams ◽  
Alternating Links ◽  
Alternating Link

It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due to the fact that reduced alternating link diagrams of the same link are obtainable from each other via flypes and flypes do not change writhe. In this paper, we introduce several quantities that are derived from Seifert graphs of reduced alternating link diagrams. We prove that they are “writhe-like” invariants, namely they are not general link invariants, but are invariants when restricted to reduced alternating link diagrams. The determination of these invariants are elementary and non-recursive so they are easy to calculate. We demonstrate that many different alternating links can be easily distinguished by these new invariants, even for large, complicated knots for which other invariants such as the Jones polynomial are hard to compute. As an application, we also derive an if and only if condition for a strongly invertible rational link.

A geometric proof that alternating knots are non-trivial

1991 ◽  
Vol 109 (3) ◽  
pp. 425-431 ◽  
Author(s):  
William Menasco ◽  
Morwen Thistlethwaite
Keyword(s):  
Jones Polynomial ◽  
Related Result ◽  
Slight Variation ◽  
Geometric Proof ◽  
Link Diagram ◽  
Combinatorial Argument ◽  
Algebraic Invariant ◽  
Almost All ◽  
Alternating Links ◽  
Alternating Link

There are many proofs in the literature of the non-triviality of alternating, classical links in the 3-sphere, but almost all use a combinatorial argument involving some algebraic invariant, namely the determinant [1], the Alexander polynomial [3], the Jones polynomial [5], and, in [6], the Q-polynomial of Brandt–Lickorish–Millett. Indeed, alternating links behave remarkably well with respect to these and other invariants, but this fact has not led to any significant geometric understanding of alternating link types. Therefore it is natural to seek purely geometric proofs of geometric properties of these links. Gabai has given in [4] a striking geometric proof of a related result, also proved earlier by algebraic means in [3], namely that the Seifert surface obtained from a reduced alternating link diagram by Seifert's algorithm has minimal genus for that link. Here, we give an elementary geometric proof of non-triviality of alternating knots, using a slight variation of the techniques set forth in [7, 8]. Note that if L is a link of more than one component and some component of L is spanned by a disk whose interior lies in the complement of L, then L is a split link, i.e. it is separated by a 2-sphere in S3\L; thus we do not consider alternating links of more than one component here, as it is proved in [7] that a connected alternating diagram cannot represent a split link.

scholarly journals The braid index of reduced alternating links

2019 ◽  
Vol 168 (3) ◽  
pp. 415-434
Author(s):  
YUANAN DIAO ◽  
GÁBOR HETYEI ◽  
PENGYU LIU
Keyword(s):  
Jones Polynomial ◽  
Link Diagram ◽  
Homfly Polynomial ◽  
Link Diagrams ◽  
Braid Index ◽  
Weight One ◽  
Minimum Number ◽  
Remarkable Result ◽  
Alternating Links ◽  
Alternating Link

AbstractIt is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result is an application of the Jones polynomial. In the case of the braid index of an alternating link, Yamada showed that the minimum number of Seifert circles over all regular projections of a link equals the braid index. Thus one may conjecture that the number of Seifert circles in a reduced alternating diagram of the link equals the braid index of the link, but this turns out to be false. In this paper we prove the next best thing that one could hope for: we characterise exactly those alternating links for which their braid indices equal the numbers of Seifert circles in their corresponding reduced alternating link diagrams. More specifically, we prove that if D is a reduced alternating link diagram of an alternating link L, then b(L), the braid index of L, equals the number of Seifert circles in D if and only if GS(D) contains no edges of weight one. Here GS(D), called the Seifert graph of D, is an edge weighted simple graph obtained from D by identifying each Seifert circle of D as a vertex of GS(D) such that two vertices in GS(D) are connected by an edge if and only if the two corresponding Seifert circles share crossings between them in D and that the weight of the edge is the number of crossings between the two Seifert circles. This result is partly based on the well-known MFW inequality, which states that the a-span of the HOMFLY polynomial of L is a lower bound of 2b(L)−2, as well as the result of Yamada relating the minimum number of Seifert circles over all link diagrams of L to b(L).

scholarly journals THE JONES POLYNOMIAL AND THE PLANAR ALGEBRA OF ALTERNATING LINKS

2010 ◽  
Vol 19 (11) ◽  
pp. 1487-1505 ◽  
Author(s):  
HERNANDO BURGOS-SOTO
Keyword(s):  
Jones Polynomial ◽  
Skein Module ◽  
Single Crossing ◽  
Planar Algebra ◽  
The Right ◽  
Alternating Links ◽  
Alternating Link

It is a well known result 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 Jones polynomial of tangles is valued in a certain skein module; we describe an alternating condition on elements of this skein module, show that it is satisfied by the Jones invariant of the single crossing tangles (⤲) and (⤲), and prove that it is preserved by appropriately "alternating" planar algebra compositions. Hence, this condition is satisfied by the Jones polynomial of all alternating tangles. Finally, in the case of 0-tangles, that is links, our condition is equivalent to simple alternation of the coefficients of the Jones polynomial.

scholarly journals The colored Kauffman Skein relation and the head and tail of the colored Jones polynomial

2017 ◽  
Vol 26 (03) ◽  
pp. 1741002 ◽  
Author(s):  
Mustafa Hajij
Keyword(s):  
Natural Extension ◽  
Jones Polynomial ◽  
Colored Jones Polynomial ◽  
Alternating Links ◽  
Skein Relation

Using the colored Kauffman skein relation, we study the highest and lowest [Formula: see text] coefficients of the [Formula: see text] unreduced colored Jones polynomial of alternating links. This gives a natural extension of a result by Kauffman in regard with the Jones polynomial of alternating links and its highest and lowest coefficients. We also use our techniques to give a new and natural proof for the existence of the tail of the colored Jones polynomial for alternating links.

POSITIVE ALTERNATING LINKS ARE POSITIVELY ALTERNATING

2000 ◽  
Vol 09 (01) ◽  
pp. 107-112 ◽  
Author(s):  
TAKUJI NAKAMURA
Keyword(s):  
Alternating Links ◽  
Alternating Link

By using a result of P. R. Cromwell on homogeneous links which contain both positive links and alternating links, we prove that any reduced alternating diagram of a positive alternating link is positive.

scholarly journals CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS

2008 ◽  
Vol 17 (01) ◽  
pp. 31-45 ◽  
Author(s):  
MARKO STOŠIĆ
Keyword(s):  
Positive Integer ◽  
Euler Characteristic ◽  
Jones Polynomial ◽  
Chain Complex ◽  
Tutte Polynomial ◽  
A Chain ◽  
Alternating Link ◽  
Dichromatic Polynomial

For each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomial. This also gives a categorification of n-specializations of the Tutte polynomial of graphs. Also, for each graph and integer n ≤ 2, we define the different one-variable n-specializations of the dichromatic polynomial, and for each polynomial, we define graded chain complex whose graded Euler characteristic is equal to that polynomial. Furthermore, we explicitly categorify the specialization of the Tutte polynomial for graphs which corresponds to the Jones polynomial of the appropriate alternating link.

On the computational complexity of the Jones and Tutte polynomials

1990 ◽  
Vol 108 (1) ◽  
pp. 35-53 ◽  
Author(s):  
F. Jaeger ◽  
D. L. Vertigan ◽  
D. J. A. Welsh
Keyword(s):  
Computational Complexity ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Wide Range ◽  
Tutte Polynomials ◽  
Special Points ◽  
Alternating Link ◽  
Special Case

AbstractWe show that determining the Jones polynomial of an alternating link is #P-hard. This is a special case of a wide range of results on the general intractability of the evaluation of the Tutte polynomial T(M; x, y) of a matroid M except for a few listed special points and curves of the (x, y)-plane. In particular the problem of evaluating the Tutte polynomial of a graph at a point in the (x, y)-plane is #P-hard except when (x − 1)(y − 1) = 1 or when (x, y) equals (1, 1), (−1, −1), (0, −1), (−1, 0), (i, −i), (−i, i), (j, j2), (j2, j) where j = e2πi/3

scholarly journals GRAPH SMALL CANCELLATION THEORY APPLIED TO ALTERNATING LINK GROUPS

2012 ◽  
Vol 21 (11) ◽  
pp. 1250113
Author(s):  
RÉMI CUNÉO ◽  
HAMISH SHORT
Keyword(s):  
Small Cancellation ◽  
Cancellation Condition ◽  
Small Cancellation Theory ◽  
Link Group ◽  
Finite Sums ◽  
Small Cancellation Condition ◽  
Alternating Links ◽  
Alternating Link

We show that the Wirtinger presentation of a prime alternating link group satisfies a generalized small cancellation condition. This new version of Weinbaum's solution to the word and conjugacy problems for these groups easily extends to finite sums of alternating links.

Sign in / Sign up

Export Citation Format

Share Document