There is a much faster way however to check a notation's drawability. Instead of considering each possible notation and doing the full calculations on all pairs of loops, one performs Equal Drawability moves on the notation. In other words, one replaces the notation under consideration by another notation such that either both are drawable or none of them. It is possible (in fact almost certain) that by performing such moves one eventually arrives to a notation that has already been checked. By applying such a procedure the whole program was accelerated by a factor of a hundred.
The equal drawability moves should not be confused with the reidemeister moves; while the latter are performed on the full projection, the former are performed on the shadow. And while the latter replace a knot with a topologically equivalent one, the former replace a shadow not by an equivalent one, but merely by one that is as drawable as the previous one. There are three kinds of "equal drawability" moves:
The first two moves always lead to a notation with a smaller crossing number, and thus if a notation allows for such moves, one has definitely avoided the time consuming full calculation. The latter may or may not be halpful; when the crossing number however becomes large, the third move possibilities increase, and thus it is very likely that one may arrive to a notation whose drawability has already been found.
To see how a shadow is transformed under these moves, click here. From the figures one should easily understand why these moves lead to equally drawable notations.
To continue with the review of my work, click here .
Charilaos Aneziris, firstname.lastname@example.org
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.