Related papers: Generating links that are both quasi-alternating a…
We construct an infinite family of quasi-alternating links from a given quasi-alternating link by replacing a crossing by a product of rational tangles each of which extends that crossing. Consequently, we determine an infinite family of…
Quasi-alternating links are a generalization of alternating links. They are homologically thin for both Khovanov homology and knot Floer homology. Recent work of Greene and joint work of the first author with Kofman resulted in the…
We prove that the degree of the Brandt-Lickorish-Millet polynomial of any quasi-alternating link is less than its determinant. Therefore, we obtain a new and a simple obstruction criterion for quasi-alternateness. As an application, we…
We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…
Champanerkar and Kofman introduced an interesting way to construct new examples of quasi-alternating links from existing ones. Actually, they proved that replacing a quasi-alternating crossing c in a quasi-alternating link by a rational…
In this paper, we show that a link which has a positive and almost alternating diagram is alternating, besides that a positive and non-alternating Montesinos link has an almost positive-alternating diagram.
Quasi-alternating links are homologically thin for both Khovanov homology and knot Floer homology. We show that every quasi-alternating link gives rise to an infinite family of quasi-alternating links obtained by replacing a crossing with…
Champanerkar and Kofman [1] introduced an innovative method for constructing quasi-alternating links by substituting a quasi-alternating crossing c in a quasi-alternating link with a rational tangle of the same type. This construction was…
The aim of this article is to detect new classes of quasi-alternating links. Quasi-alternating links are a natural generalization of alternating links. Their knot Floer and Khovanov homology are particularly easy to compute. Since knot…
Qazaqzeh and Chbili showed that for any quasi-alternating link, the degree of $Q$-polynomial is less than its determinant. We give a refinement of their evaluation.
In this note, we complete the classification of quasi-alternating Montesinos links. We show that the quasi-alternating Montesinos links are precisely those identified independently by Qazaqzeh-Chbili-Qublan and Champanerkar-Ording. A…
We prove that twisting any quasi-alternating link $L$ with no gaps in its Jones polynomial $V_L(t)$ at the crossing where it is quasi-alternating produces a link $L^{*}$ with no gaps in its Jones polynomial $V_{L^*}(t)$. This leads us to…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links…
We prove that the length of any gap in the differential grading of the Khovanov homology of any quasi-alternating link is one. As a consequence, we obtain that the length of any gap in the Jones polynomial of any such link is one. This…
A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…
The aim of this article is to give a characterization of strongly quasipositive quasi-alternating links and detect new classes of strongly quasipositive Montesinos links and non-strongly quasipositive Montesinos links. In this direction, we…
We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…
We prove that there are only finitely many values of the Jones polynomial of quasi-alternating links of a given determinant. Consequently, we prove that there are only finitely many quasi-alternating links of a given Jones polynomial iff…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…