Showing that the links are prime

One may easily show that if two links have crossing numbers L(1) and L(2), the crossing number of their unlinked union is L(1)+L(2)+1. (In the "crossing number" we also include the imaginary crossings that were removed when the original knot was converted to the link). If a presentation of this union cannot be unlinked (without resorting to equivalence moves), its number of crossings is at least L(1)+L(2)+3. This fact is very helpful in eliminating almost all combinations without even having to consider any of their invariants.

Unfortunately there is no proven such theorem for connected sums. In principle, it could be possible for the connected sum of these two links to have any crossing number between 3 and L(1)+L(2). One may only show that it cannot be trivial. Therefore, for any non-trivial link, one would have to consider all (infinite!) combinations of connected sums. To avoid such a situation, we are going to use a conjecture, that is similar to the case of links. Their crossing number is equal to L(1)+L(2), while any of its prime presentation should have a crossing number of at least L(1)+L(2)+2. Therefore, for the 118 links of our list, one need only consider the following combinations. ("T/K" stands for "Trivial Knot")

Knots

• 3-1 # 3-1
• 4-1 # 3-1

• 3-2 # 3-1
• 4-1 # 3-2
• 3-1 U T/K
• 3-1 U 3-1
• 4-1 U T/K
• 5-1 U T/K
• 5-3 U T/K
• 6-1 U T/K
• 6-3 U T/K
• 6-4 U T/K

• 3-2 # 3-2
• 3-2 U T/K
• 3-2 U 3-1
• 5-2 U T/K
• 6-2 U T/K
• 3-1 U T/K U T/K

In the following page we are going to prove that none of the 118 links is equivalent to any of the combinations above.

Charilaos Aneziris