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.

ENUMERATING PRIME LINKS BY A CANONICAL ORDER

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

    The first author defined a well-order in the set of links by embedding it into a canonical well-ordered set of (integral) lattice points. He also gave elementary transformations among lattice points to enumerate the prime links in terms of lattice points under this order. In this paper, we add some new elementary transformations and explain how to enumerate the prime links. We show a table of the first 443 prime links arising from the lattice points of lengths up to 10 under this order. Our argument enables us to find 7 omissions and 1 overlap in Conway's table of prime links of 10 crossings.

    AMSC: 57M25, 57M27