After applying the "component number" and the "linking number" invariants, we showed that the 118 links of our list can be divided into the following eight classes:
Any link belonging to one class, has been shown distinct to links belonging to any other class, since their component numbers and/or linking numbers are different. We shall now show how the colorization invariants split these links to even more (and smaller) classes, until they are all shown distinct from each other.
Notation: each invariant is indicated through the "conjugacy class of the permutation group" to which it belongs. Therefore the invariant 2-1 denotes colorizations where the acceptable "colors" are the permutations (1->2,2->1,3->3), (1->3,2->2,3->1) and (1->1,2->3,3->2). Each link will be associated to a number that indicates the number of acceptable colorizations, once the "color" of one strand is fixed. Therefore if 2-1 maps a link to the number 1, this means that if one strand of the link is mapped to the "color" (1->2,2->1,3->3), then the only acceptable colorization is the one where all strands are mapped to the same "color".
Colorization Invariant 2-1
Thus, after applying the 2-1 invariant, the original 8 classes split into 17. Out of these 17 new classes, 6 contain just one link, and thus these links have been proven to be distinct. We continue in this page with further colorization invariants.
Educational institutions are encouraged to reproduce and distribute these materials for educational use free of charge as long as credit and notification are provided. For any other purpose except educational, such as commercial etc, use of these materials is prohibited without prior written permission.