Links with splitting number one

From MaRDI portal
Publication:2230973



Abstract: 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 therefore also determine whether the unlinking number of L is 1.


Another of this author's exhaustively well-reasoned works, this paper solves a number of difficult problems for hyperbolic 2-string prime links with more than two components (or just two with linking number zero), answering the question of whether or not any of the following is equal to 1: its unlinking number, splitting number, ``distinct splitting number, total splitting number, or ``distinct total splitting number [Theorem 1]. Sixteen more theorems then outline algorithms that describe the various ways to accomplish such splittings and the paper concludes with a conjecture that ``any crossing change that turns an alternating link into a split link is equivalent to changing some crossing in some alternating diagram, mentioning a recent result of \textit{D. McCoy} [Adv. Math. 305, 757--802 (2017; Zbl 1353.57013)] that ``lends weight to such a conjecture.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Links with splitting number one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230973)