Related papers: Computing boundary slopes of 2-bridge links
We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.
We give (1) an upper bound on the denominators of numerical boundary slopes and (2) an upper bound on the differences between two numerical boundary slopes, for Montesinos knot exteriors.
We show that a two-bridge ribbon knot $K(m^2 , m k \pm 1)$ with $m > k >0$ and $(m,k)=1$ admits a symmetric union presentation with partial knot which is a two-bridge knot $K(m,k)$. Similar descriptions for all the other two-bridge ribbon…
W. Thurston suggested a method for computing hyperbolic volume of hyperbolic 3-manifolds, based on a triangulation of the manifold. The method was implemented by J. Weeks in the program SnapPea, which produces a decimal approximation as a…
In a recent work of Duke, Imamo\={g}lu, and T\'{o}th, the linking number of certain links on the space $\text{SL}(2,\mathbb{Z})\backslash\text{SL}(2,\mathbb{R})$ is investigated. This linking number has an alternative interpretation as the…
Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. Furthermore McCabe proved $s(K) \leq c(K) + 3$ for a $2$-bridge knot or…
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…
A celebrated theorem of Kirby identifies the set of closed oriented connected 3-manifolds with the set of framed links in $S^3$ modulo two moves. We give a similar description for the set of knots (and more generally, boundary links) in…
An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge…
We give infinitely many examples of 2-bridge knots for which the topological and smooth slice genera differ. The smallest of these is the 12-crossing knot $12a255$. These also provide the first known examples of alternating knots for which…
Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if…
We develop and implement an algorithm that computes the full knot Floer complex of knots of thickness one. As an application, by extending this algorithm to certain knots of thickness two, we show that all but finitely many non-integral…
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 Cayley graphs and automorphism groups for all finite $n$-quandles of two-bridge and torus knots and links, as well as torus links with an axis.
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
We show that, for an alternating knot, the ratio of the diameter of the set of boundary slopes to the crossing number can be arbitrarily large.
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…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
We determine the Dehn surgeries on 2-bridge links, which yield reducible 3-manifolds. Further, we show the conditions that we obtain a torus or cable knot from one component of a 2-bridge link by a surgery on another component.