A useful technique in virtual knot theory is {it parity theory}. The simplest example of a parity is the {it Gaussian parity}. The Gaussian parity is defined by assigning to each arrow x of the Gauss diagram D of a virtual knot K a 0 or a 1 according to whether the number of arrows in D intersecting x is even or odd. Such an assignment behaves nicely under the Reidemeister moves. The arrow involved in the Reidemeister 1 move is necessarily assigned a zero. The arrows involved in the Reidemeister 2 move must be either both assigned 0 or both assigned 1. Deleting the arrows does not affect the Gaussian parity of the remaining arrows. In the Reidemeister 3 move, we have that an even number of the 3 involved arrows must be marked 1. All classic...