Related papers: A note on the weak splitting number
The splitting number of a link is the minimal number of crossing changes between different components required to convert it into a split link. We obtain a lower bound on the splitting number in terms of the (multivariable) signature and…
The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…
If $P$ is a prime number, we show that reduced $\mathfrak{sl}(P)$ link homology with coefficients in $\mathbf{Z}/P$ detects split links. The argument uses Dowlin's spectral sequence and sutured Floer homology with twisted coefficients. When…
The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. We work with a generalization of unknotting number due to Mathieu-Domergue, which we call the untwisting number. The…
For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…
In this paper, we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete…
We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations…
It is known that algebraically split links (links with vanishing pairwise linking number) can be transformed into the trivial link by a series of local moves on the link diagram called delta-moves; we define the delta-unlinking number to be…
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…
A weak chord index $Ind'$ is constructed for self crossing points of virtual links. Then a new writhe polynomial $W$ of virtual links is defined by using $Ind'$. $W$ is a generalization of writhe polynomial defined in [6]. Based on $W$,…
Given a knot K in S^3, let u^-(K) (respectively, u^+(K)) denote the minimum number of negative (respectively, positive) crossing changes among all unknotting sequences for K. We use knot Floer homology to construct the invariants l^-(K),…
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…
We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
We define a family of link concordance invariants $\left\{ s_n \right\}_{n=2,3, \cdots}$. These link concordance invariants give lower bounds on the slice genus of a link $L$. We compute the slice genus of positive links. Moreover, these…
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…
In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni,…