World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A PARTIAL ORDERING OF KNOTS AND LINKS THROUGH DIAGRAMMATIC UNKNOTTING

    https://doi.org/10.1142/S0218216509007026Cited by:6 (Source: Crossref)

    In this paper we define a partial ordering of knots and links using a special property derived from their minimal diagrams. A link is called a predecessor of a link if and a diagram of can be obtained from a minimal diagram D of by a single crossing change. In such a case, we say that . We investigate the sets of links that can be obtained by single crossing changes over all minimal diagrams of a given link. We show that these sets are specific for different links and permit partial ordering of all links. Some interesting results are presented and many questions are raised.

    AMSC: Primary 57M25