Our first building block will be a procedure for indexing
M-rank sets, which are sets of M cards of the same suit.
With out loss of generality, let us consider the ranks to be in
{0, 1, . . . , N} and consider a set in decreasing order.
The colex function (Bollobas 1986), provides precisely
this indexing. As much of the indexing scheme is based off
the same principles, we describe the construction here.
Without loss of generality, we order the sets lexographically. For example if M = 2, h4, 1i > h3, 0i > h2, 1i. Given