Let T be a finite subset of the integers. Let sum(T) denote the sum of
the elements of T. We use t is function to construct a decomposition
of the edges of the subgraph of N and N + 1 ranked subsets of a 2N + 1
set into a disjoint union of matchings.