Related papers: Identification of 2-bridge links

Suppose that there exists an epimorphism from the knot group of a $2$-bridge knot $K$ onto that of another knot $K'$. In this paper, we study the relationship between their crossing numbers $c(K)$ and $c(K')$. Especially it is shown that…

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

We determine prime amphicheiral links with at least 2 components and up to 11 crossings. There are 27 such links. We check also special amphicheiralities. Most of prime links with up to 11 crossings are detected not to be amphicheiral by a…

We find explicit maximal rank Coxeter quotients for the knot groups of 595,515 out of the 1,701,936 knots through 16 crossings. We thus calculate the bridge numbers and verify Cappell and Shaneson's Meridional Rank Conjecture for these…

In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.

We give upper bounds of the Matveev complexities of two-bridge link complements by constructing their spines explicitly. In particular, we determine the complexities for an infinite sequence of two-bridge links corresponding to the…

Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface (called a surface-link) embedded in 4-space. In this paper,…

We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…

This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…

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

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…

A formula for the Alexander polynomial of a 2-bridge knot or link given by Hartley and also by Minkus has a beautiful interpretation as a walk on the integers. We extend this to the 2-variable Alexander polynomial of a 2-bridge link,…

In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.

Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots.…

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

We compute the bridge spectra of cables of 2-bridge knots. We also give some results about bridge spectra and distance of Montesinos knots.

In this article we study the braid indices of 2-bridge knots with a fixed crossing number $c$. We show that the average braid index of the set of $2$-bridge knots of crossing number $c$ is asymptotically linear, approaching…

We compute the maximal Thurston-Bennequin number for a Legendrian two-bridge knot or oriented two-bridge link in standard contact R^3, by showing that the upper bound given by the Kauffman polynomial is sharp. As an application, we present…

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It…