The maximal number of generator crossings and ~-equivalence classes

As explained in the introduction, we must first spend some effort in deriving estimates for the crossing number of generators of a given canonical Euler characteristic. These estimates turn out to be rather sharp and are a consequence of a detailed study of the special diagram algorithm of Hirasawa [Hi2] and myself [St9, Section 7].