There are many combinatorial structures which can be regarded as complexes of certain basic
blocks. Familiar examples are involutions, finite graphs, and Stirling numbers of the first and
second kind. Generating functions for these complexes have special forms relating the number
of basic blocks to the number of complexes. Previous...
