The mapping is considered successful if k=M(i,j) for all crossings of P.
Not any nxn matrix however is relevant. In order for a color test to be valid, one must make sure that ambient isotopic knots yield identical results. In other words, let P and P' be two regular projections connected through Reidemeister moves. Then each successful mapping of P should correspond to exactly one successful mapping of P'. This is necessary in order to be able to distinguish inequivalent knots.
Let K and K' be two knots possessing m and m' successful mappings for the same color test. If m and m' are unequal, one has shown that K and K' are not ambient isotopic.
The condition above implies the following constraints on M.
In addition, one is interested in irreducible tests only; a color test is called irreducible, if there is no subset S of {1,2,...,n} other than the empty set and {1,2,...,n} itself, such that i belongs to S => M(i,j) belongs to S for all j. This is because if a test is reducible, if one strand is mapped to an element of S, then all strands are mapped to elements of S. Therefore either all or no strands are mapped to elements of S, and thus the information obtained is equivalent to information obtained from simpler tests.
Finally by permuting 1,2,...,n, a single color test may yield a number of additional tests; all such tests however yiled identical information, and are thus considered the same. Similarly two tests M and N are considered the same if M(i,j)=k <=> N(k,j)=i, since they are related through mirror symmetry.
Under these constraints, one obtains the following number of color tests.
Charilaos Aneziris, charilaos_aneziris@standardandpoors.com
Copyright 1995
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.