Related papers: Identification of 2-bridge links

We have the generating function which determines the number of $2$-bridge knot groups admitting epimorphisms onto the knot group of a given $2$-bridge knot, in terms of crossing number. In this paper, we will refine this formula by taking…

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 study the booklink, a braid-like embedding with local maxima and minima, and the bridge-braid spectrum of a link, which captures the smallest number of braid-strands in a booklink with a prescribed number of critical points. This…

We present a table of symmetric diagrams for strongly invertible knots up to 10 crossings, point out the similarity of transvergent diagrams for strongly invertible knots with symmetric union diagrams and discuss open questions.

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…

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.…

Experimental data from Dunfield et al using random grid diagrams suggests that the genus of a knot grows linearly with respect to the crossing number. Using billiard table diagrams of Chebyshev knots developed by Koseleff and Pecker and a…

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 prove that all 2-bridge ribbon knots are symmetric unions.

Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…

In this short note we show the existence of an epimorphism between groups of $2$-bridge knots by means of an elementary argument using the Riley polynomial. As a corollary, we give a classification of $2$-bridge knots by Riley polynomials.

It is known that there are 21 ribbon knots with 10 crossings or fewer. We show that for every ribbon knot, there exists a tangle that satisfies two properties associated with the knot. First, under a specific closure, the closed tangle is…

The 2-bridge knots are a family of knots with bridge number 2. In this paper, we compute the Kauffman polynomials of 2-bridge knots using the Kauffman skein theory and linear algebra techniques. Our calculation can be easily carried out…

We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on…

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger…

Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is…

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…