Abstract

It is known that a knot/link can be nullified, i.e. can be made into the trivial knot/link, by smoothing some crossings in a projection diagram of the knot/link. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, the nullification process may be the pathway for a knotted circular DNA to unknot itself (through recombination of its DNA strands). The minimum number of such crossings to be smoothed in order to nullify the knot/link is called the nullification number. It turns out that there are several different ways to define such a number, since different conditions may be applied in the nullification process. We show that these definitions are not equivalent, thus they lead to different nullification numbers for a knot/link in general, not just one single nullification number. Our aim is to explore some mathematical properties of these nullification numbers. First, we give specific examples to show that the nullification numbers we defined are different. We provide a detailed analysis of the nullification numbers for the well known 2-bridge knots and links. We also explore the relationships among the three nullification numbers, as well as their relationships with other knot invariants. Finally, we study a special class of links, namely those links whose general nullification number equals one. We show that such links exist in abundance. In fact, the number of such links with crossing number less than or equal to n grows exponentially with respect to n.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.