Related papers: Quasi-alternating links with small determinant

We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…

We investigate connections between biquandle colorings, quiver enhancements, and several notions of the bridge numbers $b_i(K)$ for virtual links, where $i=1,2$. We show that for any positive integers $m \leq n$, there exists a virtual link…

We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…

In this paper, we prove that a link which has an almost positive diagram with a certain condition is Lagrangian fillable.

We reprove a necessary condition for the Sakuma-Weeks triangulation of a 2-bridge link complement to be minimal in terms of the mapping class describing its alternating 4-string braid construction. For the 2-bridge links satisfying this…

We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…

Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles.…

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6.

We prove that if a quasipositive link can be represented by an alternating diagram satisfying the condition that no pair of Seifert circles is connected by a single crossing, then the diagram is positive and the link is strongly…

We give a systematic construction of epimorphisms between 2-bridge link groups. Moreover, we show that 2-bridge links having such an epimorphism between their link groups are related by a map between the ambient spaces which only have a…

We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…

We publish a table of primitive finite-type invariants of order less than or equal to six, for knots of ten or fewer crossings. We note certain mod-2 congruences, one of which leads to a chirality criterion in the Alexander polynomial. We…

We study the equivariant concordance classes of two-bridge knots, providing an easy formula to compute their butterfly polynomial, and we give two different proofs that no two-bridge knot is equivariantly slice. Finally, we introduce a new…

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

With the idea of an eventual classification of 3-bridge links,\ we define a very nice class of 3-balls (called butterflies) with faces identified by pairs, such that the identification space is $S^{3},$ and the image of a prefered set of…

A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if…

Let $L$ be a oriented link such that $\Sigma_n(L)$, the $n$-fold cyclic cover of $S^3$ branched over $L$, is an L-space for some $n \geq 2$. We show that if either $L$ is a strongly quasipositive link other than one with Alexander…

In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765

The Tait conjecture states that alternating reduced diagrams of links in S^3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L. Kauffman and K. Murasugi studying the Jones polynomial. The author proved…

Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating…