ENUMERATING PRIME LINKS BY A CANONICAL ORDER
Abstract
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.